GATE DA 2024 Set 1 — Question 28
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MSQ+1 / -0MediumBinary Tree TraversalsTreesProgramming, Data Structures & Algorithms
Programming, Data Structures & Algorithms → Trees → Binary Tree Traversals
Last updated
Question
Consider the following tree traversals on a full binary tree:(i) Preorder
(ii) Inorder
(iii) PostorderWhich of the following traversal options is/are sufficient to uniquely reconstruct the full binary tree?
(ii) Inorder
(iii) PostorderWhich of the following traversal options is/are sufficient to uniquely reconstruct the full binary tree?
Correct answer
(A) (i) and (ii); (B) (ii) and (iii); (C) (i) and (iii)
Solution
To uniquely reconstruct a binary tree, Inorder traversal combined with either Preorder or Postorder traversal is sufficient. Thus, options (A) and (B) are correct for any binary tree.For a full binary tree (a tree where every node has either 0 or 2 children), the combination of Preorder and Postorder traversals is also sufficient to uniquely reconstruct the tree. This is a specific property of full binary trees.Therefore, options (A), (B), and (C) are all sufficient.
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 DA 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 1 Q15Consider that the quick sort algorithm is used to sort an array of distinct randomly ordered…2026 Set 1 Q16Consider the given Python program. [code] Which of the following is the correct output of this…2026 Set 1 Q25You are given the following Pre-order and In-order traversals of a Binary Tree T with nodes E, F,…2026 Set 1 Q31Let A be a sorted array containing 1000 distinct integers. You perform a recursive binary search on…2026 Set 1 Q39A recursive function in Python is given. [code] Now, consider the following function call:…