Question
Data Science and Artificial Intelligence Question on Representation of Binary Tree
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 ?
A
(i) and (ii)
B
(ii) and (iii)
C
(i) and (iii)
D
(ii) only
Answer
(i) and (ii)
Explanation
Solution
The correct option is (A) : (i) and (ii) , (B) :(ii) and (iii) and (C) : (i) and (iii).