Let be a binary search tree with 15 nodes. The minimum and maximum possible heights of are:
Note: The height of a tree with a single node is 0.
- A4 and 15 respectively
- B3 and 14 respectively
- C4 and 14 respectively
- D3 and 15 respectively
Data StructuresBinary Search Trees (BSTs) & Binary HeapsMCQ1 mark · −1/3 if wrongEasy
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.