Q
What is the maximum number of nodes in a binary tree of height h (where a tree with only a root has height 0)?
-
A
hΒ²
-
B
2^(h+1) - 1
-
C
2^h
-
D
2h + 1
Correct Answer:
B. 2^(h+1) - 1
Explanation:
Each level L holds at most 2^L nodes. Summing levels 0 to h gives 2^(h+1) - 1.
