GATE | DA | 2024 | Data Structure | Question 28

Last Updated :
Discuss
Comments

Consider the following tree traversals on a full binary tree:

1.PreOrder

2.Inorder

3.PostOrder

Which of the following traversal options is/are suffiecient to uniquely reconstruct the full Binary Tree?

(i) and (ii)

(ii) and (iii)

(i) and (iii)

(ii) only 

This question is part of this quiz :

GATE DA 2024,GATE DA Programming, Data structure and Algorithms Quiz
Tags:
GATE
Algorithms
Share your thoughts in the comments