A binary search tree is generated by inserting in order the following…
GATE · 1996 · CS · Question 2 subparts
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)
Attempted by 332 students.
Sign up free to check your answer
Sign up freeLoading lesson…