搜索资源列表
PostOrderTraverse
- 后序遍历非递归二叉树源代码 很简洁，很简洁，很简洁-non - recursive binary tree source code is very simple, very simple, very simple
erchashubianlisuanfa
- 遍历二叉树的非递归算法，其中有先序遍历，中序遍历和后序遍历。-traversal of a binary tree non - recursive algorithm, which preorder, preorder and after preorder.
999999
- 数据结构试验中一个有关于非递归算法的源程序，很适合于初学者参考。-test data structure on a non - recursive algorithm of the source is well-suited to beginners reference.
BiTNode
- BiTNode二叉树的递归和非递归遍历(包括中序\\先序\\后序)-BiTNode binary tree recursive and non - recursive traversal (including the sequence \\ first sequence \\ after Prologue)
btree1
- 假设二叉树采用链表方式存储,编写一个二叉树先序遍历的非递归算法-assumptions binary tree using Listless way to store, prepare a binary tree preorder non - recursive algorithm
FindSuperwayFunction
- 本程序利用数据结构中的回溯算法的非递归对以知地图进行全路线查找，可以完成最短路线，最少费用，和所有路线的显示-procedures for the use of the data structure of the back - recursive algorithm right to know what the road map for the entire search, the shortest route to be completed, at least cost, and all th
LastOrderTree
- 创建二叉树，并实现二叉树前序、中序递归遍历算法和二叉树的后序非递归遍历-create binary tree, and to achieve binary tree before the sequence, sequence recursive traversal of a binary tree algorithm and after non - recursive traversal sequence
hanoisea
- 该程序用非递归的方法实现了汉诺塔问题的求解。当源盘的数目较少时该算法的执行速度比递归算法快，但当源盘块数较多时递归算法执行速度块-the program with non - recursive method of the Tower of Hanoi problem solving. When the source of the relatively small number of sites at the time of the algorithm implementation rate f
xianxuxunhuan
- 二叉数先序循环的非递归实现，一般先序循环都是由递归实现的，按照完全二叉树格式输入字符型结点值-binary sequence a few first cycle of non - recursive, the general first order recursive cycle are achieved, In accordance with the format completely binary tree node input character values
yezi
- 利用非递归的后序遍历求二叉树的叶子结点个数-use of non - recursive after preorder for the binary tree leaf node number
fudfs
- 用dfs非递归算法遍历图。创 建图是用链表来实现。 -with scores of non - recursive algorithm traverse map. Map is created using chain is to be achieved.
3Recusive_NoRec(1)
- 北大教授张抿讲授应用栈实现从递归到非递归的转换，机制十分灵巧-taught purse up from the application stack realization of the non - recursive recursive conversion, a very ingenious mechanism
fei333
- 这是一个利用扩展先序二叉树建立二叉树,且利用非递归算法进行中序遍历的算法!-This is the first expansion of the use of a binary tree order to establish binary tree, and the use of non - recursive algorithm which preorder algorithm!
BITTREE
- 这是关于二叉树的建立，各种遍历方法，和输出的算法，包括递归和非递归的-This is the binary tree on the establishment of various traversal methods, algorithms and output, including recursive and non - recursive
doublelink
- 我写的二维链表程序(采用非递归算法实现了二维链表程序),大家可以自由使用!如果有更好的算法请给我回复.-I wrote the two-dimensional chain (non - recursive algorithm to achieve a two-dimensional chain procedures), We can freely use! If there is a better algorithm please give me a reply.
Three_Dim_Link
- 我的三维链表程序,非递归算法实现,希望各位提出宝贵意见,实际上完全可以从此得出任意多维链表的算法.-3D chain procedures, non - recursive algorithm, hoping to give valuable advice Since then, in fact, can draw arbitrary multi-dimensional chain algorithm.
8huanghouVC
- 软件简介： 那个老掉牙的问题，八皇后问题，老归老，但我很喜欢，并试图用各种方法来实现求解，出乎意料的是，同样的算法，非递归实现的速度竟然比递归实现慢！下面是当时关于算法一些说明，是用Java实现的，不过用C还是J在思想上都是一样的， -software Profile : that long-standing problems, 8 Queen's problems and old to the old, but I like and and trying to use vario
hanoiother
- 汉诺塔的非递归算法，有人有兴趣的话可以-HANOR non - recursive algorithm, people who are interested in the case can look at
Sfibo
- 用java程序现实的计算斐波那契数列的非递归程序-with java realistic calculation procedures Fibonacci series of non - recursive procedure
4feidiguisuanfa
- 遍历二叉树的4个非递归算法 vc编程基础，学生作业-binary tree traversal of the four non - recursive algorithm vc based programming, students work