Suppose you are given a binary tree with 11 nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be-
- A.2
- B.3
- C.4
- D.5
Show answer
Answer: D. 5
In a strictly binary tree with n nodes, the maximum height is (n - 1) / 2 = (11 - 1) / 2 = 5.