Upload Code
loading-left
loading loading loading
loading-right

Loading

Profile
No self-introduction
codes (1)
Stack data structure after the expression is evalu
no vote
This program uses Postfix expression is evaluated, which uses a stack, infix expression evaluation is needed to two stacks (operand stack and operate Fu Zhan), so the reader as long as about infix expression and Postfix expressions Conversion between, and Postfix expressions evaluation process. On the conversion between them, I summarized as: infix expression: a* (b+c)-d/f, b+c, BC+; a* (b+c), that is, ABC+*; d/f, DF/; Last a* (b+c)-d/f, ABC+*DF/-. On the Postfix expression is the process of evaluation of the data structure, please refer to your instruction book P60~62 (reference pages of this book below). Programs in some of the things I say easy, I have explained that Program gives only +-*/four operations, other operators, if needed, Can be inserted into the pr
R1v3r
2016-08-23
0
1
No more~