搜索资源列表
T_E.rar
- 将前缀表达式转为中缀表达式，并画出所建的树,To prefix infix expression to expression, and draw the tree built
qianzhuizhuanerchashu
- 前缀表达式转换成二叉树的代码，通过转换成二叉树可以轻松实现转换成后缀，前缀，中缀形式。-Prefix expression into a binary tree code, through the binary tree can be converted easily into a suffix, prefix, infix form.
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
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
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.
infix_lab
- converting infix to postfix and prefix-converting infix to postfix and prefix
houzui
- 计算中缀表达式，后缀表达式，前缀表达式，多项式处理-Infix expression calculation postfix expression prefix expressions, polynomials processing
Jo
- 对于任意给出的前缀或中缀或后缀表达式，构造一棵表达式二叉树并表示出来，对于构造好的二叉树，输出相应的前中后缀表达式。-For any given prefix or for constructing good binary output corresponding expression before the suffix or suffixes infix expression, the expression binary tree structure and represented.
infixprefix.c
- Infix to prefix conversion code.
traverse-postfix-to-prefix
- To create a expression tree and traverse postfix to prefix and infix.
InFix2PostFixorPreFix
- 要求：构建一个表达式树，当输入中缀表达式时，输出并打印其前缀及后缀表达式 实现：构造一个标准的表达式树的类，它涵盖先序、中序、后序遍历操作，通过不同顺序的打印操作来实现转换操作；相对于使用栈来进行转换，免去了中缀转成前缀时进行的逆序操作(Requirements: to construct an expression tree, when the input infix expression, output and print the prefix and suffix expression