搜索资源列表
erchashubianli
- 二叉树遍历问题是重要的问题。程序的实现简单而方便。-erchashu
jiafen
- 求一棵加分值最高的二叉树，其中序遍历序列为给出的节点编号顺序，如1，2，3，4，5...n，求出的树加分值最高-The highest score for an increase in the binary tree, which traversal sequence for the given node number sequence, such as 1,2,3,4,5 ... n, obtained the highest score of the tree increases
shu
- 汇编语言实现二叉树的先序中序后续遍历 不大，挺简单-Assembly language to achieve the first order binary tree in order traversal little follow-up, very simple
Tree
- 非递归先序，中序及后序遍历二叉树. 根据二叉树广义表的字符串创建二叉树-First non-recursive sequence, and after the sequence of binary tree traversal
binarytreepaixu
- 本程序实现二叉树的操作，可以进行建立二叉树，递归先序、中序、后序遍历，非递归中序遍历等操作。-Binary tree of the program operation can be carried out to establish tree, recursive first order, in sequence, after the traversal of non-recursive traversal of the operation and so on.
3.1
- 建立一棵二叉树，编写二叉树的前序遍历，中序遍历，后序遍历的递归算法与非递归算法-The establishment of a binary tree, the preparation of the first order binary tree traversal, in order traversal, postorder traversal of the recursive algorithm with non-recursive algorithm
erchashu
- (1)以回车( \n )为输入结束标志，输入数列L，生成一棵二叉排序树T； (2)对二叉排序树T作中序遍历，输出结果； (3)计算二叉排序树T查找成功的平均查找长度，输出结果； (4)输入元素x，查找二叉排序树T，若存在含x的结点，则删除该结点，并作中序遍历(执行操作2)；否则输出信息“x不存在”； (5) 输入元素x，查找二叉排序树T，若整棵树不存在含值为x的结点，则插入该结点，并作中序遍历(执行操作2)；否则输出信息“x已经存在”。 -(1) to return ( &#
erchashu
- 实现一个二叉树的建立和写出他的前序，中序，后序遍历-The realization of a binary tree establishment and write before his order, in sequence, after the traversal
erchashu
- 实现二叉树的前序非递归遍历和比较两棵二叉树是否相似的算法。-The realization of the first order binary tree non-recursive binary tree traversal and comparison of two algorithms are similar.
BTree
- 本程序采用扩展先序遍历序列的办法建立二叉树，并能实现二叉树的前，中，后和层遍历以及求深度的简单操作。-This procedure used to expand first traversal sequence to set up binary tree and binary tree to realize the before, during and after and the depth of layer traversal, as well as for simple operation.
bitree
- 二叉树的前序遍历改变为中序遍历输出，C++库封装实现-Pre-order traversal of the tree to change the traversal of the output, C++ library package to achieve
tree
- 二叉树的建立，遍历，查找等一些操作，包含递归遍历和非递归遍历-tree apply
mytree
- 二叉树结构的定义，并对所定义的树结构进行遍历-failed to translate
erchashu
- 二叉树排序 采用中序遍历的方式 从小到大排序输出-Binary tree traversal order used in a way to sort the output from small to large
BSTree_operate
- 二叉排序树的建立和遍历的程序，里面有多种遍历的方法，可以满足不同的需要。-Binary sort tree traversal of the establishment and procedures, there are a variety of ways to traverse to meet different needs.
BiTreeSort
- 二叉树三种遍历方法的程序与比较，C++代码实现。-Three methods of tree traversal and comparison of procedures, C++ code.
BFSTravers
- 图的深度，广度遍历，图的构建，树的层序遍历-Distance finding Station Traverse
InorderTraversal
- 中序遍历的递归算法定义： 若二叉树非空，则依次执行如下操作： (1)遍历左子树； (2)访问根结点； (3)遍历右子树。 -Traversal of the definition of the recursive algorithm: If the tree is not empty, then followed by the implementation of the following steps: (1) traverse the left subtree
shu
- 首先，实现二叉树的创建和中序递归遍历算法，在此基础上，进一步实现二叉树的其它递归遍历算法和横向打印算法，最后再增加二叉树的非递归遍历算法、删除子树等算法。-First of all, the realization of the binary tree in order to create and recursive traversal algorithm, On this basis, the further the other recursive binary tree traversal
na2
- 数据结构中串的实验，可实现求叶子数，求结点数，按层次遍历，求二叉树的深度等功能-Data structure in the experimental series can be realized for a few leaves, and nodes, according to the level of ergodicity, and the functions of the depth of binary tree