GATE CS 2026 (Afternoon) — Question 12

Data StructuresLinked Lists & Binary TreesMCQ1 mark · −1/3 if wrongEasy

The set T represents various traversals over binary tree. The set S represents the order of visiting nodes during a traversal. T I: Inorder II: Preorder III: Postorder S L: left subtree, node, right subtree M: node, left subtree, right subtree N: left subtree, right subtree, node Which one of the following is the correct match from T to S?
  1. A
    I – L, II – M, III – N
  2. B
    I – M, II – L, III – N
  3. C
    I – N, II – M, III – L
  4. D
    I – L, II – N, III – M
Practise the full 2026-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Linked Lists & Binary TreesTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group