搜索资源列表
T_E.rar
- 将前缀表达式转为中缀表达式，并画出所建的树,To prefix infix expression to expression, and draw the tree built
Expreesion
- 一个表达式和一棵二叉树之间，存在着自然的对应关系。写一个程序，实现基于二叉树表示的算术表达式Expression的操作。 【基本要求】 【一】【必做部分】 假设算术表达式Expression内可以含有变量（a-z）,常量（0-9）和二元运算符（+，-，*，/，^（乘幂））。实现以下操作： （1）ReadExpr(E)――以字符序列的形式输入语法正确的前缀表达式并构造表达式E。 （2）WriteExpr(E)――用带括号的中缀表达式输出表达式E。 （3）Assign(V，c
qianzhuizhuanerchashu
- 前缀表达式转换成二叉树的代码，通过转换成二叉树可以轻松实现转换成后缀，前缀，中缀形式。-Prefix expression into a binary tree code, through the binary tree can be converted easily into a suffix, prefix, infix form.
infixToprefix
- This source code is used for make infix expression from prefix expression by using assembly and C language together.
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! ! !
tree
- 算术表达式与二叉树之间存在着对应关系，编写把以前缀形式输入的合法算术表达式转换为中缀表达式，再转换为后缀表达式，并求表达式的值-Arithmetic expressions with binary tree there is a correlation between the preparation of the form to enter the legitimate prefix arithmetic expression conversion infix expression, and t
Assignment-2-final
- conversion between infix, prefix and postfix
biaodashiqiuzhi
- 通过该程序可以计算前缀、中缀和后缀表达式的值。-Through the program can calculate the prefix, infix and postfix expressions value.
2-6
- infix to prefix its a very good code for you
Expr
- 对数据结构中二叉树的理解，前缀、中缀、后缀的相互转换.-Binary tree data structure understanding, prefix, infix, suffix interchangeable.
ProExpr
- 实现表达式求值，表达式树绘制，前缀表达式转换中缀表达式，中缀表达式转换后缀表达式-To achieve expression evaluation, expression tree drawing, prefix expression conversion infix expression, the expression postfix conversion infix expression
DataStruct_expresion
- 实现把原表达式分别用中缀,后缀,前缀三个形式表达,并分别求值-Were used to achieve the original expression infix, suffix, prefix the three forms of expression, and were evaluated
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.
1
- 输入表达式 建立二叉树 通过周游 输出 中缀后缀前缀表达式-Enter the expression to establish a binary tree output by traveling prefix infix postfix expression
shuzhizhuanhuan
- 表达式是数据运算的基本形式。人们的书写习惯是中缀式，如：11+22*(7-4)/3。中缀式的计算按运算符的优先级及括号优先的原则，相同级别从左到右进行计算。表达式还有后缀式（如：22 7 4 - * 3 / 11 +）和前缀式（如：+ 11 / * 22 – 7 4 3）。后缀表达式和前缀表达式中没有括号，给计算带来方便。如后缀式计算时按运算符出现的先后进行计算。本设计的主要任务是进行表达式形式的转换及不同形式的表达式计算。-Expression is the basic form of dat
PolCalc
- This code transforms an expression from infix form to prefix form (Polonese notation) and build the binary tree for the operation and the result of the calculation.
mpi-trans
- changing infix notation to prefix notation when calculating
infix_translation
- infix to postfix prefix
infix_lab
- converting infix to postfix and prefix-converting infix to postfix and prefix
traverse-postfix-to-prefix
- To create a expression tree and traverse postfix to prefix and infix.