GATE CSE 2024 | Set 2 | Question: 29

Question

​​​​​​You are given a set $V$ of distinct integers. A binary search tree $T$ is created by inserting all elements of $V$ one by one, starting with an empty tree. The tree $T$ follows the convention that, at each node, all values stored in the left subtree of the node are smaller than the value stored at the node. You are not aware of the sequence in which these values were inserted into $T$, and you do not have access to $T$.

Which one of the following statements is TRUE?

• A. Inorder traversal of $T$ can be determined from $V$
• B. Root node of $T$ can be determined from $V$
• C. Preorder traversal of $T$ can be determined from $V$
• D. Postorder traversal of $T$ can be determined from $V$

Answer 1

Answer is A.

Inorder traversal of a binary search tree gives the sorted tree as it will traverse left root right. Also as we have the set V so we can arrange this in increasing order and derive the inorder traversal of the BST.