Question:

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 ?

Updated On: Dec 4, 2024
  • (i) and (ii)
  • (ii) and (iii)
  • (i) and (iii)
  • (ii) only
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is A, B, C

Solution and Explanation

The correct option is (A) : (i) and (ii) , (B) :(ii) and (iii) and (C) : (i) and (iii).
Was this answer helpful?
1
0

Questions Asked in GATE AR exam

View More Questions