搜索资源列表
实验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.
zhongzhuizhuanhouzhui
- 把中缀表达式转换成后缀表达式,输入中缀表达式输出后缀表达式-Chinese sergeant expressions into expressions suffix, the importation of Chinese exports suffix sergeant expression expression
后缀求值
- 中缀表达求后缀表达式及其值-expression for which there is a suffix expression and values
postfix
- 中缀表达式转中缀表达式,后缀表达式的计算-which is made up of ordinary Chinese expression to expression, the expression calculation Suffix
expression
- 中缀表达式变后缀表达式,利用堆栈的原理实现中缀表达式到后缀表达式的转换
中缀变后缀
- 这个c语言程序实现中缀表达式变为后缀表达式,并且实现其计算-the language program which is made up of expressions into a suffix expression, and its calculation
expression
- 表达式求值:利用栈操作实现由中缀表达式到后缀表达式的转换,再求值.
change
- 中缀表达式转后缀表达式,建立二叉表达式树,利用二叉表达式树求解
midtosucc
- 中缀表达式转后缀表达式-which is made up of expression to expression Suffix
EvaluateExpression.tar 数据结果实验 表达式求值
- 数据结果实验 表达式求值 中缀表达式转后缀表达式求值-Results of experimental data to evaluate the expression in infix postfix expression evaluation turn
EvaluateExpression 算术表达式求值
- 算术表达式求值: 中缀表达式求值; 将中缀转换成后缀表达式并求值-Arithmetic expression evaluation: infix expression evaluation to infix into postfix expression and evaluates
FomulaStack
- 利用栈求解算术表达式的值,程序分为两种表达式,中缀式与后缀式,分别得用栈先入后出的特性,以及运算符的优先级比较,进行求解-use arithmetic to solve the value of the expression, procedures are divided into two expressions, and the sergeant-type suffix. Stack were starting after the first-in-the characteristics, a
中缀转后缀的程序
- 将中缀表达式转化为后缀表达式,并计算它的值,采用栈结构,实现运算
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!
sangzhi
- 中缀表达式改后缀表达式,同过先建立表达式树,再对其进行后序遍历-Infix to suffix expressions expressions have to create the same expression tree, and then after its traversal
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
中缀表达式转后缀表达式并求值
- 能够用数据结构实现中缀表达式到后缀表达式的转变(Change can achieve infix expression to a postfix expression)