222. Count Complete Tree Nodes

Given a complete binary tree, count the number of nodes.

Note:

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.

Example:

Input: 
    1
   / \
  2   3
 / \  /
4  5 6

Output: 6

解法一： 直接求个数，不管什么完全二叉树。。。

class Solution {
    public int countNodes(TreeNode root) {
        if(root == null)
            return 0;
        return countNodes(root.left) + countNodes(root.right) + 1;
    }
}

解法二：
利用完全二叉树性质，可以先求出最左边的path的高度，再求出最右边path的高度，然后比较。
如果相等，说明是满二叉树，则直接返回 2 ^ h - 1 。
如果不相等，则返回左边的node数 + 右边的node数 + 1。

class Solution {
    public int countNodes(TreeNode root) {
        if (root == null) {
            return 0;
        }
        int leftDepth = leftDepth(root);
        int rightDepth = rightDepth(root);
        
        if (leftDepth == rightDepth) {
            return (1 << leftDepth) - 1;
        } else {
            return countNodes(root.left) + countNodes(root.right) + 1;
        }
    }
    
    private int leftDepth(TreeNode root) {
        int res = 0;
        while (root != null) {
            res++;
            root = root.left;
        }
        return res;
    }
    
    private int rightDepth(TreeNode root) {
        int res = 0;
        while (root != null) {
            res++;
            root = root.right;
        }
        return res;
    }
}