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?
- A. 2
- B. 3
- C. 4
- D. 6
Answer: B. 3
Explanation: Tree: 10 -> (L: 1 -> R: 3 -> R: 5) and (R: 15 -> L: 12, R: 16). Path 10-1-3-5 has 3 edges. Height = 3.