GATE CS 2024 (Afternoon) — Question 39

Data StructuresBinary Search Trees (BSTs) & Binary HeapsMCQ2 marks · −2/3 if wrongEasy

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?
  1. A
    Inorder traversal of \( T \) can be determined from \( V \).
  2. B
    Root node of \( T \) can be determined from \( V \).
  3. C
    Preorder traversal of \( T \) can be determined from \( V \).
  4. D
    Postorder traversal of \( T \) can be determined from \( V \).
Practise the full 2024-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Binary Search Trees (BSTs) & Binary HeapsTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group