Leetcode | Count Complete Tree Nodes

question

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.

explanation

(1) 利用完全二叉树的性质 当树的高度为h时 若根节点的右子树的高度为h-1 则根加上其左子树的数量为2^h 接着递归求其右子树的数量

(2) 当树的高度为h时 若根节点的右子树的高度为h-2 说明右子树比左子树少一层 根加上右子树的数量为2^h-1 接着递归求其左子树的数量即可

solution

int height(TreeNode root)
{

    return root == null ? -1 :1+height(root.left);

}

public int countNodes(TreeNode root)
{
    int h = height(root);
    return h <0 ? 0 : height(root.right)==h-1? (1<<h) + countNodes(root.right):(1<<h-1)+countNodes(root.left);
}