搜索资源列表
middlechanfinally
- 输入一个中缀表达式，将其变为后缀， 内有VC++源代码 -Enter a infix expression to turn it into suffix, with VC++ Source code
qianzhuizhuanerchashu
- 前缀表达式转换成二叉树的代码，通过转换成二叉树可以轻松实现转换成后缀，前缀，中缀形式。-Prefix expression into a binary tree code, through the binary tree can be converted easily into a suffix, prefix, infix form.
zhongzhuizhuanhouzhui
- 中缀表达式转换成后缀表达式，很经典的算法，通过编译实现！-Infix expressions into expressions suffix, it is the classic algorithm, through the compiler to achieve!
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! ! !
sangzhi
- 中缀表达式改后缀表达式，同过先建立表达式树，再对其进行后序遍历-Infix to suffix expressions expressions have to create the same expression tree, and then after its traversal
calculator
- 用栈实现简单计算器功能。中缀转后缀表达式-Simple calculator using stack functions. Expression infix to suffix
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
change
- 把中缀表达式转化为后缀表达式…… 第一行为T，表示有T组数据； 以下T行每行包含一个字符串，是中缀表达式。 对于每组测试数据数据后缀表达式。-Infix expression to postfix expression into the first act ... ... T, says there are T sets of data the following T lines each line contains a string, is the infix expres
postfix
- 用Stack类来实现中缀表达式转化为后缀表达式，并且根据后缀表达式求值-With the Stack class to implement an infix expression into postfix expression, and expression evaluation according to the suffix
zaf
- 中缀转后缀用c语言实现 数据结构课设 两种方法实现-Infix turn suffix data structure using c language classes are two ways to achieve the set
calculator
- 本程序实现了用中缀转后缀做表达式求值的算法支持函数运算 支持括号/函数嵌套 是数据结构课本中简单带括号的四则运算表达式求值的深入版-This program implements the algorithm supports infix to suffix expression evaluation function calculation support brackets/functions nested data structures textbook in simple In-dept
zToH
- 中缀表达式转后缀表达式并求值 C++ 数据结构 链栈应用-Infix expression to turn suffix expression and to find the value of C++ data structure of the chain stack application
IUnttitledd1n
- 将中缀表达式转化为后缀表达达式并求值，输出后缀表达式及值 -Infix expression conversion and evaluation to the suffix table Dada type, output postfix expression and the value of
Ebiaodashijisx
- 表达式计算，用栈实现，可实现中中缀转后缀，表达式值的计算等功能 -Expression evaluates to use the stack, can realize the function in infix to suffix, the expression value is calculated
Ucppp
- 转化实现中缀转后缀 判断表达式的输入 Visuaal C6.0环境 ，经测试可直接使用。 -Conversion to achieve infix to suffix to determine the expression input Visuaal C6.0 environment has been tested and can be used directly.
FCallczipe
- 功能超级强大的计算器。。。支持表达式运算。具有中缀转后缀功能。。。。。使用了数据结构中先进的技术，是不可多的的代码，本人就读南京大学时的作品 -Function super powerful calculator. . . Expressions are supported. With infix to suffix function. . . . . The use of advanced technology in the data structure is not much of th
zhan
- 能够将一个输入的中缀表达式（数字为一位或两位数）转换成后缀表达式，并能求出表达式的值。-Convert an input infix expression (figures for the one or two digits) the the suffix expression, and to evaluate the expression.
Fix
- 实现表达式求值，实现中缀到后缀的转换并求值（利用栈）-infix to suffix
zhongzhuizhuanhouzui
- 中缀转后缀（计算机中计算器实现的第一个步骤呢）-Infix turn suffix (the first step of a computer calculator to achieve it)
infix2postfix
- 它是一個關於方程的acm問題。 當用戶輸入信息例如（3 + 2）* 5時，程序將輸出後綴格式。 因此，該程序將中綴轉換為後綴表達式。 這個程序也被系統接受-It is a question of acm equation. When the user enters information such as (3+ 2)* 5, the program will output format suffix. Therefore, the program will convert infix to po