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 2hnodes inclusive at the last level h.

思路:如果这课完全二叉树是满二叉树的话，那么节点个数就是2^(height-1)-1,如果不是满二叉树，节点个数就是1+左子树+右子树

代码如下(已通过leetcode)

public class Solution {

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


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

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