The preorder traversal of a binary search tree is (10, 5, 1, 7, 40, 50). The…

ISRO Scientist/Engineer SC · 2023 · Computer Science · Part A · Discipline· Modified — slightly modified from the official paper; see the solution

1. A.

   (1, 5, 7, 10, 40, 50)

2. B.

   (50, 40, 10, 7, 5, 1)

3. C.

   (1, 7, 5, 10, 40, 50)

4. D.

   (1, 7, 5, 50, 40, 10)

Attempted by 713 students.

The worked solution is available to enrolled students.