A binary search tree is generated by inserting in order the following…
1996
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 173 students.
Show answer & explanation
Correct answer: B
The first element inserted, 50, becomes the root of the binary search tree. All subsequent elements less than 50 form the left subtree, while those greater than 50 form the right subtree. Counting the values less than 50 yields 7 nodes, and counting those greater than 50 yields 4 nodes.
A video solution is available for this question — log in and enroll to watch it.