[LeetCode 222] Count Complete Tree Nodes

原文地址：http://blog.csdn.net/brucehb/article/details/46448503

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.

1、最简单遍历，会超时。

2、满二叉树节点个数是2*N-1。

3、做乘法的简便操作是移位。

/**
 * 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 countNodes(TreeNode* root) {
        if(root==NULL)
            return 0;
        int left=1;
        int right=1;
        TreeNode* p=root->left;
        while(p!=NULL)
        {
            p=p->left;
            left++;
        }
        p=root->right;
        while(p!=NULL)
        {
            p=p->right;
            right++;
        }
        if(left==right)
            return (1<<left)-1;
        return countNodes(root->left) + countNodes(root->right) + 1; 
    }
};