Description: 1. There is a natural correspondence between an expression and a binary tree. Write a program to implement the operation of Expression Expression based on binary tree representation.
2. Assumes that the arithmetic Expression in the Expression can contain variables (a to z), constant (0 ~ 9) and binary operators (+, -, *, /, ^ (have been)). Implement the following operations:
(E) - enter the correct prefix expression in the form of a character sequence and construct the expression E.
The diction of WriteExpr (E) - output expression E using an infix expression with brackets.
(V, c) -- the variable Vde assignment (V = c), the initial value of the variable is 0.
In Value (E) - evaluate the arithmetic expression E.
(P, E1, E2) - construct a new compound expression (E1) P (E2).
3. At the same time, the recognition and processing of operators and operands and corresponding operations are completed.
4. When the arithmetic is recognized, the character form is converted to integer form.
5. Evaluate the expression in the order of the last traversal.
To Search:
File list (Check if you may need any files):
Download