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

分析：

某节点一直向左高度== 一直向右高度，则该节点为root的树节点数为（2^(h-1)-1)h为树高，若不相等，则递归该节点的左节点和右节点。注意递归是整个函数的递归。

代码：

/**
 * 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 lf(TreeNode* root)
    {
        int count=0;
        while(root)
        {
            count++;
            root=root->left;
        }
        return count;
    }
    int rh(TreeNode* root)
    {
        int count=0;
        while(root)
        {
            count++;
            root=root->right;
        }
        return count;
    }
    int countNodes(TreeNode* root) {
        if(!root) return 0;
        int c1=0;
        int c2=0;
        c1=lf(root->left);
        c2=rh(root->right);
        if(c1==c2){ return ((2<<c1)-1);}
        return countNodes(root->left)+countNodes(root->right)+1;
    }
};