GATEverse Practice, past papers & mock tests
GATE 2024 · CS2 - Afternoon
Programming & Data StructuresTreeshardMCQ2 marks
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?
Save your progress

Related Programming & Data Structures PYQs