搜索资源列表
Traversing_Graph
- 树的邻接表表示和邻接矩阵表示，以及图的广度优先和深度优先遍历。-Tree adjacency list representation and adjacency matrix representation, and the graph breadth-first and depth-first traversal.
Program
- 2叉树的遍历 c#编写。没有上传整个工程。但这个是主要文件-2-ary tree traversal c# write. Did not upload the whole project. But since this is the main document
erchashu
- 二叉树的遍历，简单的二叉树按先序，中序后序遍历-Binary tree traversal, a simple binary tree according to the first sequence, in order postorder traversal
binarytreealgorithms
- 二叉树的各种算法，插入、删除、查找和遍历-Binary tree algorithms, insert, delete, search and traversal, etc.
29
- 在一棵中序线索二叉树中，实现后根中序线索二叉树的遍历；在构造二叉树时进行线索化。-ThreadBinaryTree
AVL_tree
- AVl树的遍历过程，C++编程，AVL树的各种算法-AVLtree
BinaryTree
- 本程序实现二叉树的遍历，绝对原创。质量高！-A very good program .
TreeTraverse
- 原创：C#实现数据结构的树的遍历 原创：C#实现数据结构的树的遍历-C# Traverse
bianlidir
- 递归遍历目录树（用递归算法遍历目录下的文件和文件夹）-Recursively traverse the directory tree (directory with a recursive algorithm traverse the files and folders)
tree
- 二叉树的创建和二叉树的遍历，先序，中序，后序等遍历的实现。-Binary tree creation and traversal of the binary tree, preorder, inorder, and postorder traversal.
The--operation--binary-tree
- 程序的主要功能 1 按照二叉链表存贮创建二叉树 2 二叉树的遍历——先序中序后序 三种不同方式遍历 3 统计总结点与叶子节点的个数 4 树状打印二叉树 注释清楚-The main functions of the program 1 according to the binary linked list storage create binary tree 2 binary tree traverse--first order after order sequ
erchashubianli
- 二叉树遍历，实现二叉树的遍历，有中序遍历，前序遍历，后序遍历三种-Binary tree traversal, binary tree traversal, the traversal, preorder traversal, after the traversal of three
1
- 关于数据结构中二叉树的运用,主要讲述二叉树的遍历方法，包括前，后，中序遍历-tree data
bintree
- 二叉树的遍历，非递归方法，数据结构知识，实验报告！-Binary tree traversal non-recursive method, data structure knowledge, experimental reports!
tree
- 树的遍历算法C语言的实现包含了递归和非递归两种形式-Tree traversal algorithm C language implementation contains the recursive and non-recursive two forms
shudebianli
- 用c实现对二叉树的遍历，实现深度优先遍历-C of binary tree traversal, depth-first traversal
shudebianli
- 树的遍历的基本操作.小的数据结构课程设计程序-Tree traversal of the basic operation. Small data structure course design procedure
AVLtree1
- 这是正确的AVLTree的代码，实现了二叉树的遍历，可以正确执行-This is the the a correct AVLTree code, binary tree traversal can be performed correctly
erchashu
- 实现二叉树的新建，树深度叶节点的计算，实现二叉树的遍历-Achieve new calculation of the depth of the leaf node in the tree, the binary tree binary tree traversal
stutree
- 这段代码实现了二叉树的遍历，可以说是用树进行查找的实例之一-The code implements the traversal of a binary tree, we can say Find the instance of one of the tree