...
Question 2681 – KVS 22-12-2018 Part-A
November 28, 2023
Question 1465 – Data-Structures
November 28, 2023
Question 2681 – KVS 22-12-2018 Part-A
November 28, 2023
Question 1465 – Data-Structures
November 28, 2023

Question 1466 – Data-Structures

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

Correct Answer: D

Question 327 Explanation: 

In order: 0 1 2 3 4 5 6 7 8 9
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
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!