搜索资源列表
bianli
- 数据结构-遍历实验-data structure-traverse experiment
bianli
- 图的遍历，深度优先，广度优先算法，并带有邻接矩阵
BiTree
- 数据结构中的二叉树的遍历（前序、中序、后序）算法，包括递归和非递归两种实现，另外还实现了层次遍历算法(header文件夹中包含了数据结构的头文件)。-Data structure of binary tree traversal (pre-order, in sequence, after the sequence) algorithm, including recursive and non-recursive two to achieve, in addition to achieving
bianli
- 遍历二叉树 是指以一定的次序访问二叉树中的每个结点，并且每个结点仅被访问一次见图-Binary tree traversal refers to a certain tree in order to visit each node and each node has been visited only once see Figure
bianli
- 利用Visual C++ 关于图的遍历数据结构中的经典例题-Using Visual C++ on the graph traversal
bianli
- 图的遍历，对有向图进行广度和深度优先遍历。-Graph traversal, directed graph on the breadth and depth-first traversal.
bianli
- 二叉树的遍历，先序建立二叉树结构，包括前序、中序、后序遍历的递归和非递归遍历，求二叉树的深度。-Binary tree traversal, binary tree structure, the establishment of the first order, including the former order, in order, after traversing the recursive and non recursive traversal, find the depth of a
bianli
- 该方法能够完成遍历操作，遍历这种算法可以对每个数进行访问。-The method is able to complete traversal operation, this algorithm can traverse the number of visits for each.
bianli
- 这是树的非递归遍历源程序，输入一个二叉树，将输出该树经过先，中，后遍历后的结果-This is a non-recursive tree traversal source, enter a binary tree, the tree will be output through the first, during, and after traversing the result
bitree-bianli
- 输入根据用户的输入信息，建立二叉树的二叉链表。 利用递归和非递归实现二叉树的中序遍历，利用队列实现二叉树的层次遍历。 -Enter the information based on user input, the establishment of binary binary tree list. Recursive and non recursive implementation of binary tree traversal, the use of queues to achieve
bianli
- 本程序用c语言编写，是实现数的遍历。 可参考使用、学习-This procedure with c language, is to achieve the number of traversal. Can be used for reference, study
TU-BIANLI
- 图的遍历演示，无编译错误，数据结构经典练习题-data structure