Q. 74 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 (tree
height is the maximum distance of a leaf node from the root) ?
(A) 2
(B) 3
(C) 4
(D) 6
Answer: (B)
Explanation:
