In a binary tree, for every node the difference between the number of nodes in…
GATE · 2005 · IT
In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most 2. If the height of the tree is h > 0, then the minimum number of nodes in the tree is:
- A.
2h - 1
- B.
2h - 1 + 1
- C.
2h - 1
- D.
2h
Attempted by 557 students.
Sign up free to check your answer
Sign up freeLoading lesson…