Ex. 2.2 Tree evaluation 5 7 The leaves are t be an arithmetic expression that is formulated as a lated as atbinary tre at vertex is an arithmetic operatr ese structures are called arithmetic expression trees. 3 op as applied to umertcat vat 11 sume that each leaf r has i value inal and an internal vertex z has the name eor stored asn You can also assume that each operator is binary, so that eac children, Assume that you can issue calls to of its operator as h internal vertex has Two 1(op,,1), which returns write a recursive function to evaluate any such tree 7 ust assume that your interpretation and the actual coding are consistent the function eva ad 3 the numerical value of the operator the numerical values Without peeking into the text You are not asked t or eval( 3,2). assume You may wish to use a fest such as TrT TeatThen -2 is eval(-, 2, to give the code for evat, or worry about whethe