GATE CS 2025 Set 2 — Question 35
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.NAT+1 / -0EasyBinary Search TreesTreesProgramming & Data Structures
Programming & Data Structures → Trees → Binary Search Trees
Last updated
Question
Suppose the values are inserted in that order into an initially empty binary search tree. Let be the resulting binary search tree.
The number of edges in the path from the node containing to the root node of is ___________.
The number of edges in the path from the node containing to the root node of is ___________.
Correct answer
4 to 4
Solution
We insert the keys into the Binary Search Tree (BST) in the given order: .
The edges in this path are:
1.Insert 10: Root node is .
2.Insert -4: , so becomes the left child of .
3.Insert 15: , so becomes the right child of .
4.Insert 30: (Right) (Right). becomes the right child of .
5.Insert 20: (Right) (Right) (Left). becomes the left child of .
6.Insert 5: (Left) (Right). becomes the right child of .
7.Insert 60: (Right) (Right) (Right). becomes the right child of .
8.Insert 19:
- Compare with : (Go Right)
- Compare with : (Go Right)
- Compare with : (Go Left)
- Compare with : (Go Left)
- becomes the left child of .
The edges in this path are:
1.
2.
3.
4.
Total number of edges = .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]