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.

分析：分治算法，实现时需要注意的是移位运算符和加法操作符的优先级。二分法实现

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int height(TreeNode root){
        return root==null?0:1+height(root.left);
    }
    public int countNodes(TreeNode root) {
        int high=height(root);
        if(high<=1)
            return high;
        int right=height(root.right);
        if(right==(high-1)){
            return (1<<(high-1))+countNodes(root.right);
        }else{
            return (1<<right)+countNodes(root.left);
        }
    }
}