搜索资源列表
Tree+Postorder
- 层次输入建立二叉树并后序遍历,三叉链式存储,递归遍历-import levels and the establishment of a binary tree after preorder, trigeminal chain store, recursive traversal
erchashu1
- 这是二叉树的排序，使数据结构最基本的一个实现，希望对大家有点帮助-This is a binary tree, in order to make the most basic data structure to achieve one, we hope to help a bit
NTDETECT
- C++二叉树算法-C Binary Tree Algorithm
tree1
- 二叉树的算法，先序建立，中序遍历-binary tree algorithm, first sequence established, the preorder
TotalTree
- 二叉树的集合操作，附带一份程序的试验报告，相当优秀的程序，对深入理解二叉树很有帮助。-binary tree assembly operation, accompanied by a program to the test report, the procedure quite excellent, in-depth understanding of binary tree helpful.
btree
- 建立一个排序二叉树-establish a ranking Binary Tree
TernarySearchTrees
- 多重搜索树算法，性能和二叉树算法相当，但是更节省空间-multiple search tree algorithm performance and Binary Tree Algorithm considerable, but the space-saving
2chashu
- 二叉树遍历的方法-binary tree traversal methods
Creat BTree
- 创建二叉树的 Java程序-create the binary tree Java programs
ExpressionBinaryTree
- 表达式二叉树的实现。输入任意一个前序中序或后序表达式，可生成对应的表达式二叉树并树状打印，之后用户可以选择以前序中序或后序将表达式再次输出。-expression of the realization of a binary tree. An arbitrary input before the order or sequence after sequence expressions, which will generate the c
aiai
- 这是一个实现二叉树的小程序，他的实现是实现左右二叉树中的一些难题， 值的一看哦-This is the realization of a binary tree small program, he is about to achieve some of the binary tree problems a value of the FACT
BinTree2
- 完全二叉树的判别：输入一二叉树，判别是否为完全二叉树。-complete binary tree discriminant : Admission of a binary tree, to determine whether it fully binary tree.
00010
- 树的生成,能够实现二叉树的生成,用c语言编写的.-tree generation, to achieve binary tree generation, with the c language.
gtrtgdfg
- 遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化. -traverse binary tree is frequently encountered
btrxzhc
- 二叉树的先序，中序，后序，按层遍历算法。以中序输入，用‘#’代替叶子节点的子节点输入。-binary tree first sequence, sequence after sequence, layer by traversal algorithm. The order to import, use '#' instead of the leaf nodes for input nodes.
SortDll
- 这是一个二叉树排序算法的VC++6.0实现的动态连接库-This is a binary tree algorithm VC 6.0 Dynamic Link Library
sortcom
- 这是一个用COM实现的二叉树排序的算法实现，以VC++6.0实现-using COM, the binary ranking algorithm to VC 6.0
CREATE1
- 按前序遍历序列创建二叉树，并中序遍历二叉树、求二叉树高度-by creating a binary tree traversal sequence, and which preorder binary tree, seeking binary tree height
levelTree
- 按层序方式（自上而下，每层自左而右）遍历二叉树,二叉树以二叉链表作为存储-sequence by means (from top to bottom, each of which left from right) traverse binary tree, the binary tree with two forks Chain storage
LastOrderTree
- 创建二叉树，并实现二叉树前序、中序递归遍历算法和二叉树的后序非递归遍历-create binary tree, and to achieve binary tree before the sequence, sequence recursive traversal of a binary tree algorithm and after non - recursive traversal sequence