GATE | GATE-CS-2007 | Question 12

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) 2^h−1
(B) 2^h−1 -1
(C) 2^h+1-1
(D) 2^h+1


Answer: (C)

Explanation: See Question 1 https://www.geeksforgeeks.org/data-structures-and-algorithms-set-10/

Quiz of this Question