The height of a binary tree is the maximum number of edges in any root to leaf…
GATE · 2007 · CS
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height h is:
- A.
2h−1
- B.
2h−1 -1
- C.
2h+1-1
- D.
2h+1
Attempted by 1443 students.
Sign up free to check your answer
Sign up freeLoading lesson…