Knowing the preorder and inorder traversals of a binary tree will enable you to uniquely define the tree. The same is true for the postorder and inorder traversals.
a. Draw the unique binary tree that has the following preorder and inorder traversals:
Preorder: A, B, D, E, C, F, G, H
Inorder: E, D, B, A, G, F, H, C
b. Draw the unique binary tree that has the following postorder and inorder traversals:
Postorder: B, D, F, G, E, C, A
Inorder: B, A, D, C, F, E, G