-
The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?
-
- 2
- 3
- 4
- 6
Correct Option: B
Given are 10, 1, 3, 5, 15, 12, 16
The height of the leaf node (5) is high 3. Hence (b) is correct option.
