GATE CSE 2026 Session 2 Q12: Match binary tree traversals with visiting orders
- Programming and Data Structures
- 1 mark
- MCQ
- −1/3 if wrong
Question
The set T represents various traversals over binary tree. The set S represents the order of visiting nodes during a traversal.
| 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 |
Which one of the following is the correct match from T to S?
Try it: multiple choice: exactly one correct option
Show answer and explanation
Answer: A (official GATE 2026 final answer key)
Concept used: The prefix in/pre/post tells where the node is visited relative to its subtrees.
First step: Inorder visits the node between the subtrees, preorder before them, postorder after them.
Full step-by-step solution
Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.
Share this question
Source: official GATE 2026 Session 2 CS question paper and final answer key, organised by IIT Guwahati. Question paper · Answer key
More Programming and Data Structures PYQs
- 2026 Session 1 · Q23Non-leaf indices in a 1-indexed binary heap with n odd
- 2026 Session 1 · Q24Empty slots after linear-probing inserts with h(x) = (x+7) mod 11
- 2026 Session 1 · Q33Maximum height of a full binary tree with 23 nodes
- 2026 Session 1 · Q34Output of a C function with a shadowed block variable
- 2026 Session 1 · Q39Recursive length of a non-empty singly linked list
- 2026 Session 1 · Q40Third insertion that can never yield a complete BST of 1..15