Problem
1. Either prove or disprove the analogous result for preorder and postorder traversal.
2. Find a pair of sequences of the same data that could not possibly correspond to the preorder and inorder traversals of the same binary tree. [Hint: Keep your sequences short; it is possible to solve this exercise with only three items of data in each sequence.]