GATE CS 2014 Set 3 — Question 22
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+1 / -0.33MediumTree TraversalsTreesProgramming & Data Structures
Programming & Data Structures → Trees → Tree Traversals
Last updated
Question
Consider the following rooted tree with the vertex labeled P as the root:
The order in which the nodes are visited during an in-order traversal of the tree is
Correct answer
(A) SQPTRWUV
Solution
For a general tree interpreted for in-order traversal (often mapping to Left-Root-Right recursively):
This matches option (A).
1.Left Subtree (Q): Q has child S. Treating S as the left child (since it appears first/below), the in-order is
S → Q.2.Root: P.
3.Right Subtree (R): R has children T, U, V. We visit the first child (T), then the root (R), then the remaining children.
- Visit T.
- Visit R.
- Visit U's subtree: U has child W. Treating W as left child, in-order is
W → U. - Visit V.
- Sequence for R's subtree: .
This matches option (A).
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]