搜索资源列表
BinarySearchTree
- 一个最简单的二叉树的算法，包括二叉树的各种遍历，还添加了队列的层序遍历-a simple binary tree algorithm, including the binary tree traversal, but also adds a layer of Queue preorder
中序遍历
- s数据机构中的常出算法，建树后实现中序遍历，从而实现其他的转化-s data agencies of the algorithm regular contribution to realization after the preorder, thereby realizing the transformation of other
LevelOrderTraverse
- 从键盘输入二叉树的节点数据建立二叉树，然后中序遍历-keyboard input from the binary tree data to establish binary tree node, which then preorder
tree3
- 二叉树的实现代码 前序遍历 中序遍历 后序遍历-achieve binary tree traversal sequence code before the order after preorder traversal
tree1
- 二叉树的算法，先序建立，中序遍历-binary tree algorithm, first sequence established, the preorder
CREATE1
- 按前序遍历序列创建二叉树，并中序遍历二叉树、求二叉树高度-by creating a binary tree traversal sequence, and which preorder binary tree, seeking binary tree height
TwoEmbranchmentTree
- TwoEmbranchmentTree:As ancestor has its children , a tree has its leaves. we could check its leaves in terms of algorithm as preorder , midorder or postorder.-TwoEmbranchmentTree : As ancestor has its children, a tree has its leaves. we could check
ThreadBinaryTreeFindnextorFindprev
- 创建一棵二叉树，采用前序遍历的方法建立一棵树，传递的参数为一个指向结点的指针的指针，目的是为了解决传值的问题，输入@符号的时候，表示一棵子树结束线索化二叉树，寻找当前结点的后继结点，寻找当前结点的前驱结点，中序遍历 -create a binary tree using preorder before the establishment of a tree. transmission parameters of a point to the node pointer, the purpose
createBiTree
- 用C生成一个课程二叉树,同时先、中、后序遍历该二叉树-C programs generated a binary tree, first, during and after the preorder the binary tree
tree-leave
- 中序遍历输出二叉树 输出二叉树的叶子树 输出二叉树的节点数-which preorder output binary tree output binary tree leaf tree output binary tree nodes
tree-op
- 前序线索二叉树的前序遍历 中序线索二叉树的中序遍历 后序线索二叉树的后序遍历-Preorder clues before the binary tree traversal sequence which leads the order of the binary tree traversal sequence clues after the binary tree after preorder
bina_tree
- 已知一棵二叉树的先序中序遍历构造二叉树,输出其后序遍历序列-known first of a binary tree traversal sequence binary tree structure, and the output was preorder sequence
1500PrePosterous
- 此程序给出一个算法，用于计算当已知一个m叉查找树的先序和后序遍历序列后，存在多少种中序遍历可能。输入格式为m s1 s2，其中m表示m叉树，例子 2 abc cba 结果为4 2 abc bca 结果为1 10 abc bca 结果为45 13 abejkcfghid jkebfghicda 结果为207352860-this procedure is an algorithm, When used in the calculation of a known m Binary S
PerTravel_Tree
- 用图的邻接矩阵存取，来进行图的前序遍历-with the adjacency matrix access, plans to conduct the first preorder
SortTree
- 创建一棵二叉排序树，并采用中序遍历和层次遍历法输出其顶点序列，主要实验内容如下： 1. 定义二叉排序树的结构BiTree； 2. 编制二叉排序树的插入算法：void Insert_SortTree (BiTree ST, ElemType x)； 3. 编制中序遍历函数； 4. 在main()函数中完成二叉排序树的建立，以及中序遍历的输出。（二叉排序树的各个元素从键盘输入，并利用Insert_SortTree()函数进行插入建立）； 5. 编制层次遍历函数，并在main()函
blasdfew
- 以先序,中序,后序遍历二叉链表的非递归算法-to be the first sequence, sequence, after the preorder the binary tree of non - recursive algorithm
pre
- 二叉树的前序遍历-binary tree before preorder
mid
- 二叉树的中序遍历-binary tree which preorder
preorder
- 该程序完成对二叉树的非递归的前序遍历，在三种遍历方法中，这种遍历最简单，所以，核心代码自然要少很多。-completion of the process of non - recursive binary tree of the former preorder, the three traverse method, which traverse the most simple, so natural to the core code is much less.
PREORDER
- 二叉树的前序遍历非递归算法，适用于数据结构。-Preorder traversal non-recursive algorithms. For data structures.