Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order…

ISRO Scientist/Engineer SC · 2009 · Computer ScienceGATE · 2003 · CS

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 inorder traversal sequence of the resultant tree?

  1. A.

    7 5 1 0 3 2 4 6 8 9

  2. B.

    0 2 4 3 1 6 5 9 8 7

  3. C.

    0 1 2 3 4 5 6 7 8 9

  4. D.

    9 8 6 4 2 3 0 1 5 7

Attempted by 909 students.

Show answer

Correct answer: C

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…