222. Count Complete Tree Nodes

Given a complete binary tree, count the number of nodes.

Definition of a complete binary tree from Wikipedia:
In a complete binary tree every level, except possibly the last, is completely filled, and all nodes in the last level are as far left as possible. It can have between 1 and 2^h nodes inclusive at the last level h.

Subscribe to see which companies asked this question

水一发啊，水一发～～～

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int dfs(TreeNode *root, int h) {
        if(root->right == NULL) {
            return 1 + (root->left != NULL);
        }
        TreeNode *lc = root->left;
        TreeNode *rc = root->right;
        TreeNode *p = rc;
        int hh = 0;
        while(p != NULL) ++hh, p = p->left;
        if(hh == h - 1) {
            return (1<<hh) + dfs(rc, h - 1); 
        }
        return (1<<hh) + dfs(lc, h - 1);
    }
    int countNodes(TreeNode* root) {
        if(root == NULL) return 0;
        TreeNode *p = root;
        int h = 0;
        while(p != NULL) ++h, p = p->left;
        return dfs(root, h);
    }
};