The following numbers are inserted into an empty binary search tree in the given order: 10, 21, 27, 5, 33, 49, 9, 42, 18, 4, 32, 7, 65. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?
(A) 3
(B) 4
(C) 5
(D) None


Answer: (C)

Explanation: Construction of binary search tree,

Therefore, height of the binary search tree is 5.

So, option (C) is correct.

Quiz of this Question