-
Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are :
Note : The height of a tree with a single node is 0.
-
- 4 and 15 respectively
- 3 and 14 respectively
- 4 and 14 respectively
- 3 and 15 respectively
- 4 and 15 respectively
Correct Option: B
Since there are 15 nodes, hence the minimum height of the tree will be 3 (when tree will be balanced).
Min. height = floor (log2 N)
= floor (log2 15) = 3
The maximum height will be when the tree is skew tree, which will give rise to height 14 either it will be left or right skewed tree. Hence option (b) is correct.
