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.

求一颗完全二叉树的节点数目。直接遍历会TimeOut，因此不能采用遍历的方法。

结合完全二叉树的特点，对于节点node，有如下特性：

1、取node节点左节点到最左边叶子节点的高度h0，以及node节点右边子节点到最左边节点的高度h1

2、如果有h0 = h1，则说明node节点的左子树是一颗满二叉树，可直接通过公式2^n - 1计算得到node左子树的节点数

3、如果有h0 > h1，则说明node节点的右子树是一个满二叉树，也可通过公式2^n - 1计算得到node右子树的节点数

4、递归求解子树

本程序效率很高，比普通的递归求解子树效率更高，因为普通的递归求解子树高度会多次访问相同节点，本程序避免了相同节点重复访问问题，程序如下所示：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    private int totalCnt = 0;
    public int countNodes(TreeNode root) {
        if (root == null){
            return 0;
        }
        getCount(root);
        return totalCnt;
    }
    public void getCount(TreeNode root) {
        if (root == null){
            return ;
        }
        int leftHeight =  getLeftHeight(root);
        int rightLeftHeight = getRightLeftHeight(root);
        while (root != null){
            if (leftHeight == rightLeftHeight){
                totalCnt += (1 << leftHeight);
                leftHeight = rightLeftHeight - 1;
                root = root.right;
                rightLeftHeight = getRightLeftHeight(root);
            }
            else {
                totalCnt += (1 << rightLeftHeight);
                leftHeight = leftHeight - 1;
                root = root.left;
                rightLeftHeight = getRightLeftHeight(root);
            }
        }
    }
    
    public int getLeftHeight(TreeNode root){
        int cnt = 0;
        while (root.left != null){
            root = root.left;
            cnt ++;
        }
        return cnt;
    }
    public int getRightLeftHeight(TreeNode root){
        int cnt = 0;
        if (root == null){
            return cnt;
        }
        root = root.right;
        while (root!= null){
            root = root.left;
            cnt ++;
        }
        return cnt;
    }
}

小插曲：上述程序中

totalCnt += (1 << leftHeight);

totalCnt += (1 << rightLeftHeight);

处，一开始直接用totalCnt += Math.pow(2, leftHeight);以及totalCnt += Math.pow(2, rightLeftHeight;语句，但是程序会报TimeOut，一开始觉得非常奇怪，因为程序的时间复杂度已经很低了（Log2(Height)），所以将其该为移位运算，效率很高，击败92.14%。