GATE | GATE CS 1996 | Question 39

A binary search tree is generated by inserting in order the following integers:

 50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24 

The number of nodes in the left subtree and right subtree of the root respectively is
(A) (4, 7)
(B) (7, 4)
(C) (8, 3)
(D) (3, 8)


Answer: (B)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Save