Leetcode 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 2h nodes inclusive at the last level h.

计算完全二叉树的节点数。

直接暴力会超时，需要运用完全二叉树的性质。

首先一直往左子数遍历计算出树的高度。

然后从根节点开始比较，先比较右子树和树的高度，如果高度相同，则左子树是高度为h-1的满二叉树，加上根节点一共有1<<(h - 1)个节点，然后以右子树为根节点向下。

如果高度不相同，则右子树是高度为h-2的满二叉树，加上根节点一共有1<<(h - 2)个节点，然后以左子树为根节点向下。

/**
 * 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)
    {
        if(!root) return 0;
        return 1 + dfs(root->left);
    }
    int countNodes(TreeNode* root) {
        int h = dfs(root), res = 0;
        while(root)
        {
            if(dfs(root->right) == h - 1)
            {
                res += 1 << (h - 1);
                root = root ->right;
            }
            else
            {
                res += 1 << (h - 2);
                root = root ->left;
            }
            h--;
        }
        return res;
    }
};