Let \(T\) be a binary search tree with \(15\) nodes. The minimum and maximum…
GATE · 2017 · CS · Set 1 · Computer Science & IT
Let be a binary search tree with nodes. The minimum and maximum possible heights of are:
Note: The height of a tree with a single node is .
- A.
4 and 15 respectively.
- B.
3 and 14 respectively.
- C.
4 and 14 respectively.
- D.
3 and 15 respectively.
Attempted by 611 students.
Sign up free to check your answer
Sign up freeLoading lesson…