搜索资源列表
二叉树的遍历.rar
- 数据结构中的平衡二叉树的代码
二叉树1212
- 建立二叉树，层序、先序遍历（ 用递归或非递归的方法都可以-establish binary tree, sequence, the preorder (with the recursive and non - recursive method can be
二叉树操作&图的遍历操作
- 二叉树操作&图的遍历操作， 完全按照里面的文挡用VC所完成的程序， 有详细的说明-binary tree traversal operation of the plan operations, in full accordance with the text inside the block with VC performed by the procedure is described in detail in
递归中序遍历排序二叉树
- 这是一个中序遍历二叉树的VC实现，要注意的是输入节点后，以－1结束-which is a binary tree traversal sequence VC, to pay attention to the input nodes, in the end -1
二叉树的创建及先序、中序、后序遍历
- 实现数据结构中的二叉树的创建及先序、中序、后序遍历-data structure to create the binary tree and first sequence, sequence, after the preorder
遍历二叉树的4个非递归算法
- 二叉树的4个非递归算法,中序先序后序和层次遍历,算法都有注释而且很详细,适合数据结构学习者使用-binary tree four non - recursive algorithm, the first sequence after sequence and the sequence level traversal algorithm Notes but have very detailed data structure suitable for use Learners
图形演示二叉树程序
- 用TC20 图形方式演示了二叉树的遍历程序，可以作为学生的教学用-TC20 graphic demonstration of a binary tree traversal procedures can be used as a teaching students
二叉树jian
- 这个程序采用先序建立二叉树，并分别使用递归和非递归算法实现了对该二叉树的先中后序的遍历输出，并给出了一定的使用说明-this procedure was used in order to establish a binary tree respectively, and the use of recursive and non - recursive algorithm of this binary tree after the first sequence which Ergodic outp
9二叉树
- 几乎包括二叉树的所有编程算法，其中有二叉树的先中后序递归与非递归遍历算法，由先序与后序建立二叉树，层次遍历，求叶子结点数，总结点数，树的深度与宽度。-including binary tree almost all programming algorithm, these binary tree after the first sequence which recursive and non - recursive traversal algorithm, and by the first se
二叉树的各种遍历操作(非)递归
- 数据结构的基本应用，二叉树的遍历。适合初学者，比较简单。 -the basic data structure application binary tree traversal. For beginners, relatively simple.
二叉树的类实现
- 二叉树的一般操作: 1. 判断二叉树是否为空。 2. 搜索二叉树中的某一项。 3. 在二叉树中插入一项。 4. 从二叉树中删除一项。 5. 求二叉树的高度。 6. 求二叉树的节点数量。 7. 求二叉树的叶节点数量。 8. 遍历二叉树。 9. 复制二叉树。 -binary tree : 1. To judge whether the binary tree is empty. 2. Binary Tree Search of a one. 3. The in
非递归前序,中序,后序遍历二叉树(优化算法)
- 非递归前序,中序,后序遍历二叉树(优化算法)-before non - recursive sequence, sequence after sequence binary tree traversal (optimization algorithm)
树（非二叉树）的建立与后序遍历
- 树（非二叉树）的建立与后序遍历-tree (non-binary tree) and the establishment after preorder
二叉链表表示的二叉树
- 按照先序序列构造一棵以二叉链表表示的二叉树T，然后对T进行非递归中序遍历、递归后续遍历和层序遍历。
实习五 二叉树的存储与遍历
- 二叉树的存储与遍历-binary tree traversal and storage
先序遍历二叉树
- 现实先序遍历二叉树！-reality preorder binary tree!
二叉树建立
- 输入并建立一颗二叉树,在以某种遍历顺序显示出来-importation and the establishment of a binary tree in order to traverse some displayed
二叉树2
- 生产数，并且前序遍历，而且还能交换左右儿子。(The production number, and the preface traversing, and can also exchange the right and left sons.)
1160300803_樊静_实验二
- 森林和树的基本操作 ，森林的存储，森林转化成二叉树，二叉树的先序中序后序非递归遍历，以及区间编码(The basic operations of forests and trees, the storage of forests, the conversion of forests into two forked trees, the preorder and the post order of the two forked trees, and the interval encoding,
project7
- 利用构造完全二叉树的方法建立二叉树结构。(1) 实现二叉树的先序、中序、后序遍历以及求深度操作；(2) 利用堆栈进行中序遍历并指出栈内最多元素个数。(The structure of binary tree is established by constructing complete binary tree. To realize the traversal of the binary tree in order, in order and after order and to find th