搜索资源列表
中序遍历程序
- 一个C++的中序遍历程序，输入一组数据后能中序遍历并升序输出。-one C and the preorder procedures, a data input after which preorder and ascending output.
二叉排序树的中序遍历
- 二叉排序树的中序遍历-two forks of trees were preorder
树的建立和遍历52
- 树的建立和遍历 可以实现的VC-the establishment and tree traversal can be achieved VC
图的遍历3
- 图的遍历 绝对OK啦-map traverse absolutely OK
7.先序遍历的非递归算法
- 先序遍历的非递归算法-preorder non - recursive algorithm
先序非递归遍历
- 用非递归的方法先序遍历二叉树-non - recursive method preorder Binary Tree
遍历菜单并通过树形视图分配权限
- 遍历菜单并通过树形视图分配权限-traverse through the menu tree and the distribution of competences View
图遍历
- 本程序用邻接矩阵实现图的深度优先遍历 图的广度优先遍历-the procedures used adjacency matrix of the plan is to achieve depth-first traversal of the plan breadth priority Ergodic
遍历网页中的元素
- 本软件实现对浏览器打开的网页进行监视、模拟操纵、动态提取用户输入、动态修改等功能，围绕如何遍历 HTML 中的表单(form)并枚举出表单域的属性为目标，对于网页中的其它元素，比如图象、连接、脚本等等都实现了枚举！-the software to the browser to open the website for surveillance, simulation manipulation, dynamic extraction of
遍历文件夹并建成目录树
- 用VC实现遍历文件夹并建成对应的目录数。实现的操作封装成类，可重用。-with VC traverse folders and the completion of the corresponding directory number. To achieve the package into operation category, reusable.
二叉树的中序遍历和存储
- 用c实现的二叉树的中序遍历的读取与存储，能体现出向左倒的二叉树的打印界面，界面简单。-achieved using the binary tree traversal sequence which read and storage, will be shown left one of the binary tree Print interface that simple.
图遍历应用
- 数据结构的图的遍历应用程序设计算法实现的源代码，请大家多多指教。-data structure plans Ergodic application design algorithm source code, please exhibitions.
图的遍历演示
- 一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Descr iption many issues involving maps of algorithms are to traverse the map-bas
代表恢复能否遍历
- 用汇编写了数据结构中遍历二叉数的例子，前序，中序，和后序都实现了-was compiled using data structure traverse two forks few examples, the former sequence, sequence, sequence and after bringing the
Java二叉树的后续遍历
- Java二叉树的后续遍历 Java二叉树的后续遍历主要应用于逆波兰式的求解,在编译中很重要.-Java two following forks the tree traversal Java two following to fork the tree traversal mainly applies in goes against the Poland -like solution,Is very important in the
广度优先遍历图
- 广度优先遍历实验报告 供初学者参考，通过对该系统的设计，可以很好的理解树的概念和用途-breadth - first traversal report experimental reference for beginners, the system design can have a very good understanding of the concept of the tree and use
马的遍历
- 马的遍历算法 实现马的遍历问题 使用C语言编写 如果不好请大家原谅-Ma Algorithm Ergodic problems using C language, if you will forgive bad
遍历二叉树
- 按层遍历二叉树的算法设计C语言数据结构作业-layer by the binary tree traversal algorithm design C language data structures operations
二叉树的生成与遍历
- 建立并按前,中,后序方法遍历二叉树,本代码用的是非递归方法,递归方法的稍后给出-established as before, during and after the binary tree traversal sequence method, the code of non - recursive method, recursive method is later