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.
官方解答:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int countNodes(TreeNode root) {
int height=getHeight(root);
if(height==0)return 0;
if(getHeight(root.right)==height-1)
{
return (1<<height-1)+countNodes(root.right);
}
else
{
return (1<<height-2)+countNodes(root.left);
}
}
public int getHeight(TreeNode root)
{
if(root==null)return 0;
return 1+getHeight(root.left);
}
}