1) Assume that you are given both the preorder and postorder traversal of some binary tree t. Prove that this information, taken together, is not necessarily sufficient to reconstruct t uniquely, even if each value in t occurs only once. 2) Now, assume that you have the preorder and inorder traversals of a tree (given below). Construct the corresponding binary tree and determine its postorder traversal.
Inorder Traversal: C A B D E F
Preorder Traversal: D C B A F E