-
tree
求二叉树的深度:
给定一个有根二叉树,规定连接两个节点的每条边长度是1,定义树的深度为根到叶子节点距离的最大值。 (Description
给定一个有根二叉树,规定连接两个节点的每条边长度是1,定义树的深度为根到叶子节点距离的最大值。 )
- 2011-12-11 20:42:18下载
- 积分:1
-
Insert-and-delete-binary-sort-tree
用c/c++写的二叉排序树的插入与删除,有兴趣的朋友可以看一下(Insertions and deletions using c/c++ to write binary sort tree)
- 2015-01-22 14:24:13下载
- 积分:1
-
code
C++实现的两类问题随机森林生成算法,对学习随机森林很有帮助(Source code for random forests,wanderful codes,and help youself to it!)
- 2020-06-29 22:20:02下载
- 积分:1
-
findpt
VC游戏编写中的求解最短路径算法源码,本示例是自动寻径演示,篮点是起点,红点是终点,按确定键开始。源码爱好者注:编译后运行的时候请把EXE文件从Debug目录中拷贝到项目根目录中,若不然会出错。 (The preparation of the VC games to solve the shortest path algorithm source code, in this example is the automatic routing demonstration, the basket is the starting point, the red dot is the end point, press the OK button to start. Source enthusiasts Note: When compiled and run, please copy the EXE file from the Debug directory to the root directory of the project, and if not be wrong.)
- 2013-05-17 15:38:23下载
- 积分:1
-
c语言,码图合集
说明: a set of uestc computer academic matu
- 2020-04-05 20:19:20下载
- 积分:1
-
ListOrder
链表,输入一定的数据,通过链表进行储存,并排序后输出。(List。Input numbers,then output in order~~)
- 2011-11-24 11:02:04下载
- 积分:1
-
algorithm
一本介绍各种算法的经典书籍,计算机算法设计与分析(A classic book introduces a variety of algorithms, algorithm design and analysis of computer)
- 2011-08-08 22:13:02下载
- 积分:1
-
zuiyouerfenjiansuozhu
最优二叉搜索树问题具有最优子结构性质,即其任意一棵子树都是一棵独立的最优二叉搜索树,所以可以采用动态规划方法,并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)
- 2013-10-10 18:48:17下载
- 积分:1
-
CEIA
POJ141的源代码,以空间换时间,速度很快很好用。(POJ141 the source code for time in space, fast easy to use.)
- 2011-10-25 18:13:24下载
- 积分:1
-
tt0202
1.建立两个有序得链表(带表头,用头插法);
//2.写一算法在单链表上实现线性表的ListLength(L)运算。
写一算法将单链表中值重复的结点删除,使所得的结果表中各结点值均不相同。
(1. The establishment of two ordered lists too (with header, with the first interpolation) // 2. To write a method to achieve a single linked linear form of ListLength (L) operations. Write an algorithm to list the value of a single node to delete the duplicate, so the results in the table are not the same as the value of each node.)
- 2010-09-10 10:26:46下载
- 积分:1