You are given a set π of distinct integers. A binary search tree π isβ¦
GATE Β· 2024 Β· CS Β· Set 2 Β· Computer Science & IT
You are given a set π of distinct integers. A binary search tree π is created by inserting all elements of π one by one, starting with an empty tree. The tree π 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 π, and you do not have access to π.
Which one of the following statements is TRUE?
- A.
Inorder traversal of π can be determined from π
- B.
Root node of π can be determined from π
- C.
Preorder traversal of π can be determined from π
- D.
Postorder traversal of π can be determined from π
Attempted by 519 students.
Show answer
Correct answer: A
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