The inorder and preorder traversal of a binary tree are
$\text{d b e a f c g}$ and $\text{a b d e c f g}$, respectively
The postorder traversal of the binary tree is:
-
$\text{d e b f g c a}$
-
$\text{e d b g f c a}$
-
$\text{e d b f g c a}$
-
$\text{d e f g b c a}$