GATE DS&AI 2024 | Question: 18

Question

​​​​​​Consider the following tree traversals on a full binary tree:

1. Preorder
2. Inorder
3. Postorder

Which of the following traversal options is/are sufficient to uniquely reconstruct the full binary tree?

• A. $\text{(i) and (ii)}$
• B. $\text{(ii) and (iii)}$
• C. $\text{(i) and (iii)}$
• D. $\text{(ii) only}$

Answer 1

I think the Ans is A,B,C
A and B is evident

For C refer here => https://gateoverflow.in/168546/does-unique-binary-tree-possible-binary-preorder-postorder