The numbers 70, 50, 10, 80, 30, 60, 100, 90, 40, 20 are inserted in the given order in to a binary search tree. What is the in-order traversal sequence of…
The numbers 70, 50, 10, 80, 30, 60, 100, 90, 40, 20 are inserted in the given order in to a binary search tree. What is the in-order traversal sequence of the resultant binary search tree?
Show answerHide answer
Correct answer: (D) 10, 20, 30, 40, 50, 60, 70, 80, 90, 100
Explanation
In-order traversal of any binary search tree visits the keys in ascending sorted order: 10, 20, ..., 100.