edited by
23,359 views
25 votes
25 votes

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?

  1. $7 \ 5  \ 1 \ 0 \ 3 \ 2 \ 4 \ 6 \ 8 \ 9$

  2. $0 \ 2 \ 4 \ 3 \ 1 \ 6 \ 5  \ 9  \ 8  \ 7$

  3. $0 \ 1 \ 2 \ 3 \ 4 \ 5 \ 6 \ 7 \ 8 \ 9$

  4. $9 \ 8 \ 6 \ 4  \ 2  \ 3 \ 0 \ 1 \ 5 \ 7$

edited by

3 Answers

Best answer
33 votes
33 votes

In-order traversal returns the elements in ascending (smallest to largest) order.

Therefore, correct option C

edited by
0 votes
0 votes
Inorder traversal on BST gives sequence in increasing order(not just Sorted Order)

so Answer is C
Answer:

Related questions

55 votes
55 votes
6 answers
3
44 votes
44 votes
5 answers
4