搜索资源列表
实验7 二叉树 北京师范大学数学科学院
- 自创的算法，输入表达式，建立二叉树的程序，然后输出前缀中缀后缀表示法，利用的对表达式的分割与递归实现输入，同时这也是一个完整的波兰式转换程序，相当稳健-own algorithm, the importation of expression, the establishment of the binary tree and then output the suffix prefix which is made up of the method, using the right expressio
转换中缀表达式求值
- 实现中缀变后缀表达式求值.用VC编写的,大家可以来看看,发表下意见也行. -realization grade change suffix expression evaluated. VC prepared, we can look at, to publish opinions OK.
后缀求值
- 中缀表达求后缀表达式及其值-expression for which there is a suffix expression and values
中缀变后缀
- 这个c语言程序实现中缀表达式变为后缀表达式，并且实现其计算-the language program which is made up of expressions into a suffix expression, and its calculation
calculator
- 表达式计算器，实现+,-，*，/,中缀转后缀-calculator
中缀转后缀的程序
- 将中缀表达式转化为后缀表达式，并计算它的值，采用栈结构，实现运算
aa
- 简单的一遍编译器输入中缀表达式输出后缀表达式-Again a simple compiler input infix expression output suffix expressions
Caluate
- 将中缀表达式转换为后缀表达式，并计算任意四则运算表达式的结果，采用链表和队列实现，非文法和状态机-Infix expression would be converted to suffix expressions, and calculate the arithmetic expression of arbitrary results, the use of linked lists and queues to achieve, non-grammar and the state machine
3071102672_A
- 计算后缀表达式，先将中缀式转化为后缀式，在进行计算，有较高的效率-Suffix calculated expression, first in the up-type into a suffix-style, in terms of higher efficiency
middlechanfinally
- 输入一个中缀表达式，将其变为后缀， 内有VC++源代码 -Enter a infix expression to turn it into suffix, with VC++ Source code
zhongzhuizhuanhouzhui
- 中缀表达式转换成后缀表达式，很经典的算法，通过编译实现！-Infix expressions into expressions suffix, it is the classic algorithm, through the compiler to achieve!
convert
- 后缀式转中缀式 将由数字和四则运算符组成的后缀表达式变换为中缀表达式。 输入的后缀表达式包含的运算符不超过15个。 要求转换后的中缀表达式中不应出现不必要的括号。例如， 整个表达式两端的括号要省略，不影响原计算顺序的括号要省 略。-Suffix-type switch-type will be made up of four numbers and the composition operator for suffix expressions transform inf
1
- 实现中缀表达式转后缀表达式，并利用后缀表达式求值-Infix expression to expression algorithm suffix
InToPost
- 输入中缀式，转换为后缀式，并输出结果。如2+2*2，得出结果为6.-Input is made up of type, into a suffix-type, and output. Such as 2+2* 2, the results for the 6.
erchashu
- 是一份比较全面的有关于，二叉树知识的讲解，其中同时包括，前缀中缀后缀的的表达形式。希望能帮到大家-Is a more comprehensive information on, on the tree of knowledge, which also include the prefix infix suffix expressions. I hope to help you! ! !
transform
- 输入表达式的中缀表达形式，通过编程（借助栈）实现中缀表达式到后缀表达式的转换-Input infix expression forms of expression, through the program (with stacks) infix expression to achieve expression of the conversion suffix
InfixToFuffix
- 利用堆栈，将中缀表达式转化为后缀表达式，并且输出表达式。-The use of the stack will be made up of expressions into expressions suffix
MidToPost
- 中缀变后缀表达式求值：输入表达式，#为结束符(如1+2#），程序会自动给出后缀表达式，并给出最终计算结果。程序中部分地方有注释-Variable postfix infix expression evaluation: Enter the expression,# to end the character (eg, 1+2#), the program will automatically give postfix expression, and gives the end result. So
ExpressionTest
- 中缀表达式转后缀表达式基本思路是：用一个链表 List 储存将要生成的后缀表达式；用一个栈 Stack 储存操作符；判断当前节点， 如果是操作数， 直接加入后缀表达式中， 如果是操作符，则比较前一个操作符和当前操作符的优先级…… -Infix expression basic idea is to switch to postfix expression: list List with a store that will be generated by postfix expression
中缀转后缀
- 数据结构课程练习：中缀输入，转换为后缀输出(The practice of data structure course: input infix to postfix output.)