申論題

7.(15%) A binary expression tree data structure uses the node data element given as follows. A node either represents a value or represents an arithmetic operator in { +, -, *, / }. An evaluation of an example expression tree is shown in Figure 4. Write a recursive algorithm evaluate(roos) to perform such expression evaluation task where root points to the root element of the expression tree.