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

PYQ LTIMindtree Hiring Assessment 2025

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. 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 389 students.

Sign up free to check your answer

Sign up free

Explore the full course: Cdac C Cat Complete Preparation

Loading lesson…