GATE CS 2026 Set 2 — Question 12
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+1 / -0.33EasyTree TraversalsTreesProgramming & Data Structures
Programming & Data Structures → Trees → Tree Traversals
Last updated
Question
The set T represents various traversals over binary tree. The set S represents the order of visiting nodes during a traversal.
Which one of the following is the correct match from T to S ?
| T | S | ||
|---|---|---|---|
| I: | Inorder | L: | left subtree, node, right subtree |
| II: | Preorder | M: | node, left subtree, right subtree |
| III: | Postorder | N: | left subtree, right subtree, node |
Correct answer
(A) I – L, II – M, III – N
Solution
The standard definitions for binary tree traversals are:
I L
II M
III N
1.Inorder (I): Visit Left subtree, then Node (Root), then Right subtree. This matches L.
2.Preorder (II): Visit Node (Root), then Left subtree, then Right subtree. This matches M.
3.Postorder (III): Visit Left subtree, then Right subtree, then Node (Root). This matches N.
Therefore, the correct matching is:I L
II M
III N
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 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]2026 Set 2 Q30The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function…