搜索资源列表
3
- 将表达式存入二叉树中，并输出，先序、中序、后序遍历输出-The expression in binary tree, and output, first order, in the preface, traverse sequence after the output
5
- 二叉树实现逻辑表达式真值判断，适用初次学习二叉树的朋友-Binary tree to achieve logical expression to determine true value, the application of the initial study tree friends
qianzhuizhuanerchashu
- 前缀表达式转换成二叉树的代码，通过转换成二叉树可以轻松实现转换成后缀，前缀，中缀形式。-Prefix expression into a binary tree code, through the binary tree can be converted easily into a suffix, prefix, infix form.
ercha
- 利用C语言写的二叉树应用关于表达式处理源代码-Using C language to write applications on the expression of the binary tree deal with source code
Expressiontree
- 表达式二叉树求值的源程序代码，用visualc++环境-Expression tree is evaluated using the source code visualc++ environment
huffman
- 二叉树 Huffman树 稀疏矩阵 中缀表达式计算 简单的堆栈操作 -Huffman tree binary tree is made up of sparse matrix expression in the stack is simple to operate
tree
- 二叉树的遍历问题中关于使用二叉树进行表达式求值-Binary Tree Traversal issues on the use of the expression tree for evaluation
calc
- 在以二叉树表示算术表达式的基础上，设计一个十进制的四则运算的计算器。[设计要求]实现整数浮点数的四则运算，并且还加上了^的运算，支持括号及开始的负数-In a binary arithmetic expression that is designed based on a four decimal arithmetic calculator. [Design requirements] to achieve a four-integer floating-point arithmetic, an
eeeee
- 实现基于二叉树表示的算术表达式实现基于二叉树表示的算术表达式-eeeeaaaaaaaaaaaaaannnnnnnnnnnnnnnnnnnn
basicoperationfortree
- 包括了树的一些基本操作及一些树的结构表示，如二叉树（以char 为数据和以int为数据 ），线索二叉树，二叉排序树(int)，HuffmanCoding and Huffman tree，建表达式树，遍历及与遍历有关的操作等-Includes some of the tree basic operations and a number of tree structure representation, such as the binary tree (in char to int for the
2tree
- 中序表达式先换为后续表达式后入2叉树后按二叉树方式输出-Expression in order for the first follow-up after the expression tree into two by binary mode output after
convert
- 输入二叉树的前序表达式，转换为后序表达式,并打印转换步骤和结果-Enter the first order binary tree expression, converted to the order of expression, and print results of conversion steps and
expresiontree
- 这个程序主要实现了表达式求值的算法，主要是用二叉树进行递归求解-The program mainly achieved expression evaluation algorithm was used in a binary tree recursively solving
suanfa
- 数据结构基本算法演示程序实现： 1、实现KMP模式匹配算法、哈夫曼编码算法、由遍历序列恢复二叉树、Prim算法、Kruskal算法、Floyd算法、Dijkstra算法、拓扑排序、关键路径算法、二叉排序树生成算法（含平衡化）、哈希表生成及哈希查找算法、希尔排序、快速排序、堆排序、归并排序、基数排序。（四则表达式计算、矩阵运算、有向图的强连通分量求解） 2、算法中的链表结构和数组结构的基本操作要求单独函数实现（同组内算法要求共享使用）。 要求数据结构基本算法演示程序具有菜单选择，算法要
shiyanwwu
- 则运算式求值，将四则运算式用中缀表达式表示，然后将它转变成后缀表达式，并且计算结果。 2、 基本要求：要求运用二叉树来实现。 -The expression is evaluated, the four expressions that use the infix expression, and then to transform it into a postfix expression, and results. 2, the basic requirements: Requir
expression
- 利用二叉树计算中序表达式，并且以树形结构输出二叉树，遍历二叉树-Binary sequence using the calculation expression, and to output binary tree, binary tree traversal
1
- 输入表达式 建立二叉树 通过周游 输出 中缀后缀前缀表达式-Enter the expression to establish a binary tree output by traveling prefix infix postfix expression
Data-structure-curriculum-design-
- 数据结构课程设计论文,包含表达式求解及平衡二叉树两个内容。-Data structure curriculum design papers, contain expression and the balanced binary tree to solve the two contents.
tree
- 二叉树中缀转前缀，后缀表达式。另标有注释-failed to translate
Using-binary-tree
- 数据结构课程设计 利用二叉树存储表达式，并求值，返回-Curriculum design using the binary tree data structure stored in the expression and evaluation, return