搜索资源列表
李森数据结构作业
- 文件夹中包括常用的数据结构的算法，包括二叉树的三种递归和非递归算法，染色问题，八皇后问题，深度广度遍历，约瑟夫环，数值转换，树的高度和叶子节点数，最小生成树 ，两点之间的所有路径-folder include common data structure of the algorithm, including the three binary tree recursive and non - recursive algorithm, Dyeing, 8 Queen, depth and bread
rdel
- 该程序是用汇编语言编写的，采用COM 文件格式。主要设计思想为：把目录当作N个结点的二叉树， 采用二叉树的先序遍历完成对盘上目录的搜索、定位，即从根目录开始用INT21H的 4EH号子功能搜索匹配目录（CL=10H）并判断搜索的结果是否为目录，若是则进入此目录，删除文件后继续搜索下一级子目录。若不是则用INT21H的4FH号子功能搜索下一个匹配目录， 并在判断为真后进入目录删除文件，如此一级一级地纵向深入子目录删除文件，直到完成此目录的最后一级子目录的文件删除（遍历左子树）。然后用INT21的4
erchashu3
- 二叉树的便先中后三中递归和非递归方式的实现-binary tree after they were first three recursive and non - recursive approach to achieve
HanNuoTa
- 用非递归解决汉诺塔问题 采用二叉树查找的方法 made by a___9-non - recursive HANOR solve problems using the binary tree search method made by a___9
BTREE2006
- 一个非递归建立二差树的算法!输入先序带结束符号的序列建立二叉树!原创-establish two poor tree algorithm! First imported symbols sequence ended with the establishment of the sequence binary tree! Originality
csharpshili
- Visual C#案例集锦 第一章C# Windows编程基础 实例1 循环语言的学习-砝码程序验证 实例2 随机数的案例-洗牌程序 实例3 通过实例来剖析C#继承机制 实例4 递归与全局变量的案例1-打靶程序 实例5 递归与全局变量的案例2-二叉树 实例6 引用类型的举例---消去字符串空格 实例7 委托的使用方法实例---加减大小比较 实例8 用C＃索引器实现文本文件的倒叙输入 实例9 C#文本文件操作实例---杨辉三角形写入读出
erchashubianlisuanfa
- 遍历二叉树的非递归算法，其中有先序遍历，中序遍历和后序遍历。-traversal of a binary tree non - recursive algorithm, which preorder, preorder and after preorder.
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
6.44
- 哈夫曼树，二叉树列表，的多元递归算法gfdgfdgd-Huffman tree, binary tree list, the multi - recursive algorithm gfdgfdgd
Tree+Postorder
- 层次输入建立二叉树并后序遍历,三叉链式存储,递归遍历-import levels and the establishment of a binary tree after preorder, trigeminal chain store, recursive traversal
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
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
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
4feidiguisuanfa
- 遍历二叉树的4个非递归算法 vc编程基础，学生作业-binary tree traversal of the four non - recursive algorithm vc based programming, students work
电话本管理系统
- 该系统是本人课程设计作业，因为时间关系，只用了两天多的时间编成。所以有很多地方没有得到增强。版本为1.0。现作以下升级。 增加NEW，OPEN版本。 提高输入容错。判断输入的对错。 时间关系，搜索功能为线性搜索，现增强如下：f_search:费氏查找法；btree:二叉树查找法；l_search：线性查找法； r_search：递归折半查找法；zcsear:杂凑碰撞查找法；o_sear:插补查找加强法； 排序是冒泡法，现增强为：heaps:累堆排序；binary：二叉树排序；xieer：谢耳排序
last
- 二叉树的后序算法(递归)-after the sequence of binary tree algorithm (recursive)
Binarytree
- 二叉查找树：删除比指定元素大或小的元素，删除一个范围内的元素；删除、插入、查找非递归以减少运行时间；寻找第i大的元素(Binary Search tree: delete elements larger or smaller than the specified element, delete an element within a range; delete, insert, find function in non recursion to reduce running time; find