GATE DA 2024 — Question 28

Programming, Data Structures and Algorithmsbasic data structures: stacks, queues, linked lists, trees, hash tablesMSQ1 markMedium

Consider the following tree traversals on a full binary tree: (i) Preorder (ii) Inorder (iii) Postorder Which of the following traversal options is/are sufficient to uniquely reconstruct the full binary tree?
  1. A
    (i) and (ii)
  2. B
    (ii) and (iii)
  3. C
    (i) and (iii)
  4. D
    (ii) only
Practise the full 2024 paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on basic data structures: stacks, queues, linked lists, trees, hash tablesTimed, 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