1. Give the expression tree for ((a+(b-c))*(d-e))+(f*(h-i) 2. For the tree shown in this figure, answer the following questions. a) Height of the tree = ? b) Depth of node ? c) Height of node ? d) Redraw the tree by the First-child, Next Sibling method. e) Give the post-order, pre-order and in-order G traversals of the tree. L M 3. It is possible to reconstruct (meaning, draw) the tree given only the tree's pre-order and in-order traversals. To illustrate this, draw the tree by reconstructing it from the following traversals (note that both traversals represent the same tree): Pre-order traversal: a, f, e, d, g, b, c In-order traversal: e, f, g, d, b, a, c