2.2k views

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 | 2.2k views

In-order traversal returns the elements in sorted order.

Therefore, it's option C

edited by
+1 vote

## Inorder traversal

1. First, visit all the nodes in the left subtree
2. Then the root node
3. Visit all the nodes in the right subtree

1
2