Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order…
2017
Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the reversal ordering on natural numbers i.e. 9 is assumed to be smallest and 0 is assumed to be largest. The in-order traversal of the resultant binary search tree is
- A.
9, 8, 6, 4, 2, 3, 0, 1, 5, 7
- B.
0, 1, 2, 3, 4, 5, 6, 7, 8, 9
- C.
0, 2, 4, 3, 1, 6, 5, 9, 8, 7
- D.
9, 8, 7, 6, 5, 4, 3, 2, 1, 0
Attempted by 338 students.
Show answer & explanation
Correct answer: D
In a binary search tree, the in-order traversal always outputs elements sorted according to the comparison logic used during insertion. Since this problem specifies a reversal ordering where 9 is considered smallest and 0 is largest, the sorted sequence must range from 9 down to 0. Consequently, regardless of insertion order, the in-order traversal will yield the values 9, 8, 7, 6, 5, 4, 3, 2, 1, 0.
A video solution is available for this question — log in and enroll to watch it.