The post-order traversal of a binary tree is ACEDBHIGF. The pre-order…
2020
The post-order traversal of a binary tree is ACEDBHIGF. The pre-order traversal is
- A.
ABCDEFGHI
- B.
FBADCEGIH
- C.
FABCDEGHI
- D.
ABDCEFGIH
- E.
None of these
Attempted by 285 students.
Show answer & explanation
Correct answer: E
We cannot create a unique tree with post and pre-order traversal. We need to have either inorder with preorder or postorder, if it would have been Binary search tree then inorder is sorted sequence and tree is possible but here only binary tree is given.
A video solution is available for this question — log in and enroll to watch it.