搜索资源列表
xiaoxiaoniao1
- 这是一个用C++编写的二叉树的按层遍历程序,用于计算机专业的课程设计。-This is a C prepared by the binary tree-traversal procedures for the computer professional curriculum design.
btree1
- 假设二叉树采用链表方式存储,编写一个二叉树先序遍历的非递归算法-assumptions binary tree using Listless way to store, prepare a binary tree preorder non - recursive algorithm
Tree+Postorder
- 层次输入建立二叉树并后序遍历,三叉链式存储,递归遍历-import levels and the establishment of a binary tree after preorder, trigeminal chain store, recursive traversal
tree1
- 二叉树的算法,先序建立,中序遍历-binary tree algorithm, first sequence established, the preorder
gtrtgdfg
- 遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化. -traverse binary tree is frequently encountered in a operation. Binary Tree ca
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.
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
3adf
- 遍历是二叉树各种操作的基础,显示,遍历过程中可以对各结点进行各种操作,又实现各种的目的。-traverse binary tree is the basis for various operations, that the process can traverse the nodes of various operations, Also achieve various objectives.
ThreadBinaryTreeFindnextorFindprev
- 创建一棵二叉树,采用前序遍历的方法建立一棵树,传递的参数为一个指向结点的指针的指针,目的是为了解决传值的问题,输入@符号的时候,表示一棵子树结束线索化二叉树,寻找当前结点的后继结点,寻找当前结点的前驱结点,中序遍历 -create a binary tree using preorder before the establishment of a tree. transmission parameters of a point to the node pointer, the purpose
tudeshengdubianli
- 图的深度遍历,用二叉树实现,输入时要遵循二叉树的顶点和边数的对应关系-traverse the depth map, using binary tree realize that the importation of binary tree to be followed when the number of vertices and edges of the relationship
createBiTree
- 用C生成一个课程二叉树,同时先、中、后序遍历该二叉树-C programs generated a binary tree, first, during and after the preorder the binary tree
yezi
- 利用非递归的后序遍历求二叉树的叶子结点个数-use of non - recursive after preorder for the binary tree leaf node number
fuTree
- 一个比较全的关于二叉树的操作的程序,包括树的建立,遍历,求深度,节点计算和销毁。-a more complete binary tree on the operating procedures, including the establishment of the tree, traverse, seeking depth Node calculation and destruction.
cengxubianlierchashu
- shi.c 说明:本程序用于层序遍历二叉树.程序开始时先由用户先根序输入二叉树各结点值,对于空结点输入宏ENDTAG所对的值(暂定为整数0). 建立好二叉树后即可自动进行遍历依次层序输出各结点的值. ----Author:zhg 2006.11.26 E-mail: wudazhg@163.com 仅供参考学习之用,所有权保留-shi.c : The procedures for the binary tree traversal sequence. procedure
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
lll333
- 这是一个利用扩展先序二叉树建立二叉树,并采用先序,中序,后序进行遍历的算法!-This is the first expansion of the use of a binary tree order to establish binary tree, and a first sequence, sequence, After traversal sequence for the algorithm!
fei333
- 这是一个利用扩展先序二叉树建立二叉树,且利用非递归算法进行中序遍历的算法!-This is the first expansion of the use of a binary tree order to establish binary tree, and the use of non - recursive algorithm which preorder algorithm!