Loading previous year questions
Programming and Data Structures · Trees
Official IIT answer key · IIT Kanpur · Audited Aug 2026
GATE CSE 2015 Set 1 Q25 · MCQ · 1 mark
Key concept
No account needed
Sit 5 related 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
In GATE CS, the 'Trees' topic tests structural counting relations in binary trees, tree traversal techniques (standard, custom, and multi-way tree traversals), tree reconstruction from sequences, expression tree evaluations, and recursive algorithms over binary/multi-way tree representations. Questions are heavily weighted towards 1-mark foundational items (both MCQ and NAT) with 2-mark questions focusing on code analysis or expression optimization.
Full Trees guide →The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 5 are
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.