-
The inorder and preorder traversal of a binary tree are d b e a f c g and a b d e c f g, respectively The postorder traversal of the binary tree is.
-
- d e b f g c a
- e d b g f c a
- e d b f g c a
- d e f g b c a
- d e b f g c a
Correct Option: A
In order d b e a f c g
preorder a b d e c f g
1st element of pre order is root
in preorder b is before d e. & c is before f g.
