Show by example that knowing the results of a preorder traversal and a post order traversal of a binary tree does not uniquely determine the tree; that is, give an example of two different binary trees for which a preorder traversal of each gives the same result, and so does a post order traversal.