void traverse(TreeNode *t, int &sum){ traverse(t->pLeft, sum); if (t == NULL) {++sum; return;} traverse(t->pRight, sum); }