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

