GATE CS 2021 Set 1 — Question 20
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
A binary search tree contains distinct elements. What is the time complexity of picking an element in that is smaller than the maximum element in ?
Correct answer
(D) Θ(1)
Solution
To find an element smaller than the maximum in a Binary Search Tree (BST) with distinct elements ():
1.Check the root. If the root has a right child, then the root is smaller than the maximum element (which would be in the right subtree). Return the root.
2.If the root does not have a right child, then the root is the maximum element. Since , the root must have a left child. The left child (and any node in the left subtree) is smaller than the root. Return the left child.
Both checks and operations take constant time . Thus, the time complexity is .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]