Loading previous year questions
Programming and Data Structures · Binary Search Trees
Official IIT answer key · IIT Kanpur · Audited Aug 2026
GATE CSE 2015 Set 1 Q10 · MCQ · 1 mark
Key concept
No account needed
Sit 5 related Binary Search TreesPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
Binary Search Trees (BSTs) in GATE CS test a balance of traversal mechanics, structural properties, worst-case vs. balanced-case complexities, and sequential insertion dynamics. Questions frequently test the fundamental invariant that an inorder traversal yields a strictly sorted sequence, enabling unique reconstruction from preorder or postorder alone. Recent years (2022–2026) show a noticeable shift toward structural constraints (complete BSTs, heap/array indexing, ancestor insertion order dependencies, and successor relationships).
Full Binary Search Trees guide →Which of the following is/are correct inorder traversal sequence(s) of binary search tree(s)? I. 3, 5, 7, 8, 15, 19, 25 II. 5, 8, 9, 12, 10, 15, 25 III. 2, 7, 10, 8, 14, 16, 20 IV. 4, 6, 7, 9, 18, 20, 25
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.