A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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 usual ordering on natural numbers. What is the in-order traversal sequence of the resultant tree ?
a. 7 5 1 0 3 2 4 6 8 9
b. 0 2 4 3 1 6 5 9 8 7
c. 0 1 2 3 4 5 6 7 8 9
d. 9 8 6 4 2 3 0 1 5 7
Answer:0 1 2 3 4 5 6 7 8 9
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: