Count Complete Tree Nodes Problem


Description

LeetCode Problem 222.

Given the root of a complete binary tree, return the number of the nodes in the tree.

According to Wikipedia, every level, except possibly the last, is completely filled in a complete binary tree, 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.

Design an algorithm that runs in less than O(n) time complexity.

Example 1:

1
2
Input: root = [1,2,3,4,5,6]
Output: 6

Example 2:

1
2
Input: root = []
Output: 0

Example 3:

1
2
Input: root = [1]
Output: 1

Constraints:

  • The number of nodes in the tree is in the range [0, 5 * 10^4].
  • 0 <= Node.val <= 5 * 10^4
  • The tree is guaranteed to be complete.


Sample C++ Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
class Solution {
public:
    int countNodes(TreeNode* root) {
        if(!root) 
        	return 0;

        int hl=0, hr=0;
        TreeNode *l=root, *r=root;

        while (l) {
        	hl ++;
        	l = l->left;
        }

        while (r) {
        	hr ++;
        	r = r->right;
        }

        if (hl==hr) 
        	return pow(2,hl)-1;

        return 1 + countNodes(root->left) + countNodes(root->right);
    }
};




Related Posts

Super Egg Drop Problem

LeetCode 887. You are given k identical eggs and you...

Peak Index In A Mountain Array Problem

LeetCode 852. Let’s call an array arr a mountainif the...

Numbers At Most N Given Digit Set Problem

LeetCode 902. Given an array of digits which is sorted...

Nth Magical Number Problem

LeetCode 878. A positive integer is magical if it is...

Koko Eating Bananas Problem

LeetCode 875. Koko loves to eat bananas. There are n...