What is the minimum height for a binary search tree with 60 nodes?
2024
What is the minimum height for a binary search tree with 60 nodes?
- A.
1
- B.
3
- C.
4
- D.
5
Attempted by 112 students.
Show answer & explanation
Correct answer: D
The minimum height of a BST with k nodes is ⌊log₂(k)⌋. For 60 nodes: ⌊log₂(60)⌋ = ⌊5.9⌋ = 5. So the minimum height is 5.