搜索资源列表
bin_tree
- 自己数据结构试验课写的二叉树的遍历，简单实用,可以用一用-C program to solve bin_tree
bitree
- 二叉树的遍历,才用四种遍历方式，前，中，后，层次遍历-bitree search
shu_bianli
- 该程序实在mfc下实现二叉树的遍历（数据结构知识），一方面涉及数据结构知识，另一方面涉及mfc知识，功能较全。-The program is to achieve binary tree traversal mfc (data structure knowledge), on the one hand knowledge of data structures involved, the other involving mfc knowledge, capabilities than the wh
erchashu
- 二叉树的遍历算法与实现，有前序 后序，中序的排列，分为递归算法和非递归算法的实现-Binary tree traversal algorithm and implementation of a pre-order after the order, the order of arrangement, is divided into a recursive algorithm and the realization of non-recursive algorithm
erchashu
- 数据结构中二叉树的遍历，对二叉树进行先序，中序，后序遍历，其中要用到循环查找-Traversing the binary tree data structure, the first sequence of binary tree, in order, post-order traversal, which use to find circular
shu
- 本程序主要是展示树的基本操作，包括二叉树的遍历，左右子树的互换等-This program is just for show the basic operation of the tree, including the binary tree traversal, so the exchange of left and right subtrees
erchashu
- 这是一个计算二叉树中叶子个数的程序，利用到，二叉树的遍历-This is a calculation of the number of leaves of a binary tree program, the use of that binary tree traversal
erchashubianli
- 实现二叉树的遍历，用C++实现，字数还没到啊-To achieve binary tree traversal, using C++ implementation, words not to ah. . .
java-programme
- 此程序实现了二叉树的遍历，并计算向二叉树插入或删除n个随机字符串时所消耗的时间-This program implements a binary tree traversal, and calculate the binary tree insert or delete a random string of n the time consumed
balanced-bianary-tree--traversal
- 平衡二叉树的遍历，左旋，右旋，左平衡，右平衡-Balanced binary tree traversal, L, D, left a balance, the right balance
tree
- 用c++实现二叉树的遍历，进行数据的查找-Binary tree with c++ implementation of traversal, the search data
tree
- 二叉树的遍历，能够进行前序，中序和后序的排列。-Binary tree traversal, can be pre-order, the order and arrangement of the order
Binary-tree-traversal-algorithm
- 二叉树的遍历有常用的三种方法，分别是：先根次序、中根次序、后根次序。为了验证这几种遍历算法的区别，本次的实验将会实现所有的算法。 遍历的时候，把结点的信息打印出来，为了让结点的信息更容易区别，在每个结点前加上数字标识。如：data[1]=A,data[2]=B. 实现的算法皆为递归算法 -Binary tree traversal has used three methods, namely: first, the root sequence, the order of the ro
BiTree
- 二叉树的建立与操作，可以结合二叉树的遍历-The establishment and operation of a binary tree, binary tree traversal can be combined
erchashubianli
- 二叉树的遍历，适用于VC环境 是一个基本的源代码-just for VC environment
BinaryTree
- 实现二叉树的基本操作，前序遍历、中序遍历、后序遍历、层次遍历实现二叉树的遍历方法-The basic operation of the binary tree preorder traversal, the traversal after traversal, level traverse the binary tree traversal
Binary-Tree
- 源代码实现了二叉树的遍历以及输出。直接可以运行，代码完整。-Binary Tree
Binary-Tree(new)
- 源代码实现了二叉树的遍历以及输出。直接可以运行，代码完整。-Binary Tree
BtreeOrder
- 二叉树的遍历，实现二叉树的前序、中序、后序遍历，包含递归和非递归算法-Binary tree traverse, realize the binary tree before, in order of sequence, after traverse sequence, including recursive and the recursion algorithm
1
- 三种二叉树的遍历算法，先序，中序，后序等的实现，采用C语言代码来实现的。-Three binary tree traversal algorithm, the first order, in sequence order of implementation, using C language code.