-
Consider the label sequences obtained by the following pairs of traversals on a labelled binary tree. Which of these pairs identify a tree uniquely ?
(i) Preorder and postorder
(ii) Inorder and postorder
(iii) Preorder and inorder
(iv) Level order and postorder
-
- (i) only
- (ii) and (iii)
- (iii) only
- (iv) only
- (i) only
Correct Option: B
For a tree we not only require in order & preorder but also postorder traversal.
Preorder & postorder help to determine the roots of binary subtrees, inorder arranges those roots in order. Hence (b) is correct option.
