Interview Preparation
- Interview Preparation For Software Developers
- Must Coding Questions - Company-wise
- Must Do Coding Questions - Topic-wise
- Company-wise Practice Problems
- Company Preparation
- Competitive Programming
- Software Design-Patterns
- Company-wise Interview Experience
- Experienced - Interview Experiences
- Internship - Interview Experiences
Commerce
- Commerce
- Class 11 Accountancy Notes
- Class 12 Accountancy Notes
- Accountancy
- Class 11 Business Studies Notes
- Class 12 Business Studies Notes
- Business Studies
- Class 11 Microeconomics Notes
- Class 11 Statistics For Economics Notes
- Class 12 Macroeconomics Notes
- Class 12 Indian Economic Development Notes
- Economics
- Management
- Income Tax
- Finance
GATE | CSE 2024 | Set 2 | Question 40
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)
In order traversal of T can be determined from V
(B)
The 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
Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!
Last Updated :
Share your thoughts in the comments
GeeksforGeeks