leetcode 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.

直接递归，不考虑完全二叉树性质是肯定会超时的，可以这样考虑，如果以root为根，若root一直向左的深度和一直向右的深度相同，则以root为根的子树必是一颗满二叉树，结点数可直接计算，若不相同则递归对左右进行调用，代码：

public int countNodes(TreeNode root) {
    if(root==null) return 0;
      int l=countleft(root)+1;
    int r=countright(root)+1;
    if(l==r) return (1<<l)-1;
    else return countNodes(root.left)+countNodes(root.right)+1;

}
public int countleft(TreeNode root){
    int count=0;
    while(root.left!=null){
        count++;
        root=root.left;
    }
    return count;
}
public int countright(TreeNode root){
    int count=0;
    while(root.right!=null){
        count++;
        root=root.right;
    }
    return count;
}