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; }
* }
*/
public class Solution {
public int countNodes(TreeNode root) {
if(root == null) {
return 0;
}
int left = leftHeight(root);
int right = rightHeight(root);
if(left == right) {
return (1 << left) - 1;
}
return countNodes(root.left) + countNodes(root.right) + 1;
}
private int leftHeight(TreeNode node) {
int height = 0;
while(node != null) {
height++;
node = node.left;
}
return height;
}
private int rightHeight(TreeNode node) {
int height = 0;
while(node != null) {
height++;
node = node.right;
}
return height;
}
}