UGC-NET | UGC-NET CS 2017 Dec 2 | Question 22

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) 3
(B) 4
(C) 5
(D) 6


Answer: (A)

Explanation: We have 10, 1, 3, 5, 15, 12, 16 keys and we have to insert these keys into a binary search tree (BST):