ISRO | ISRO CS 2020 | Question 46
The post-order traversal of a binary tree is ACEDBHIGF. The pre-order traversal is
(E) None of these
Explanation: We can not create binary tree uniquely with either pre-order or/and post-order. We strictly need in-order of binary tree with either pre-order or/and post-order.
So, option (E) is correct.
Note that if given tree was Binary search tree (BST), then we were able to create BST uniquely, as in-order of BST is always sorted order.