搜索资源列表
Expression-evaluation(suffix-method)
- 在栈的思想下，利用后缀表达式解决表达式求值的问题。类似的，可以推广到前缀表达式求值。-Thinking in the stack, using postfix expression evaluation expression to solve the problem. Similarly, the prefix can be extended to expression evaluation.
src
- This program takes an equation in prefix,infix, or postfix mode with proper parenthesis and parses the equation into a binary tree to show which equations come first, then outputs the same equation back in prefix,infix, and postfix notation.
post_to_pre
- 将后缀表达式转换成前缀表达式：从键盘读入一后缀表达式，转化成前缀式-Prefix to postfix expression into the expression: read from the keyboard into a postfix expression, converted into a prefix-style
1
- 输入表达式 建立二叉树 通过周游 输出 中缀后缀前缀表达式-Enter the expression to establish a binary tree output by traveling prefix infix postfix expression
infix_lab
- converting infix to postfix and prefix-converting infix to postfix and prefix
Project-Diva-4
- 课程作业, 将输入的前缀表达式转换为对应的逆波兰表达式(后缀表达式)-Course work, the prefix expression is converted to the corresponding input Reverse Polish Notation (postfix expression)
e
- 按常规形式输入算术表达式（例如：输入2*(6-4)+8/4），要求能够： （1）生成表达式的后缀表示，并输出； （2）生成表达式的前缀表示，并输出； （3）基于表达式的后缀表示，对该表达式求值； （4）编写一个主程序对表达式求值函数进行测试。 -Enter a conventional form of arithmetic expressions (for example: Input 2* (6-4)+8/4), requires the ability to: (1) t
traverse-postfix-to-prefix
- To create a expression tree and traverse postfix to prefix and infix.