首页 > itarticle > [leetcode] problem 222 – count complete tree nodes

[leetcode] problem 222 – count complete tree nodes

admin 11月 13, 2020 0

Given a complete binary tree, count the number of nodes.

Note

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

Example

Input:

Output: 6

Code

public class  {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode(int x) { val = x; }
}

public int countNodes(TreeNode root) {
    int leftHeight = getLeftHeight(root);
    int rightHeight = getRightHeight(root);

    if (leftHeight == rightHeight)
        return (int) Math.pow(2, leftHeight) - 1;
    else
        return countNodes(root.left) + countNodes(root.right) + 1;
}

private int getLeftHeight(TreeNode root) {
    int height = 0;

    while (root != null) {
        height++;
        root = root.left;
    }

    return height;
}

private int getRightHeight(TreeNode root) {
    int height = 0;

    while (root != null) {
        height++;
        root = root.right;
    }

    return height;
}