Question: 1. Find an example of a tree whose inorder and postorder traversals yield the same list of nodes.
2. Find two different trees that have the same list of nodes under a preorder traversal.
3. Informally describe a recursive algorithm to compute the height of a binary tree, given the root node.
4. Informally describe a recursive algorithm to compute the number of nodes in a binary tree, given the root node.