GATE CS 2015 Set 3 — Question 27
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+1 / -0.33EasyBinary Search TreesTreesProgramming & Data Structures
Programming & Data Structures → Trees → Binary Search Trees
Last updated
Question
While inserting the elements 71, 65, 84, 69, 67, 83 in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is
Correct answer
(B) 67
Solution
Let's insert the elements sequentially into an empty BST:
Level 1: 71
Level 2: 65, 84
Level 3: 69, 83
Level 4: 67The lowest level (deepest) is Level 4, which contains the element 67.
1.Insert 71: Root (Level 1).
2.Insert 65: , so left child of 71 (Level 2).
3.Insert 84: , so right child of 71 (Level 2).
4.Insert 69: (left), (right). Right child of 65 (Level 3).
5.Insert 67: (left), (right), (left). Left child of 69 (Level 4).
6.Insert 83: (right), (left). Left child of 84 (Level 3).
The levels are:Level 1: 71
Level 2: 65, 84
Level 3: 69, 83
Level 4: 67The lowest level (deepest) is Level 4, which contains the element 67.
Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Trees
2026 Set 2 Q12The set T represents various traversals over binary tree. The set S represents the order of…2026 Set 2 Q19Consider the following three ANSI-C programs, P1, P2, and P3. P1 [code] P2 [code] **P3**…2026 Set 1 Q23Let be an odd number greater than 100. Consider a binary minheap with elements stored in an…2026 Set 1 Q24Consider a hash table that is initially empty. The hash table is maintained…2026 Set 1 Q27Consider the following C statements: Which of the following options is/are correct? [figure]