-
chazhao
数据结构课程作业,查找算法。用哈希算法下实行查找(Data structure course work, search algorithm. Under the hash algorithm used to find)
- 2009-07-08 02:41:51下载
- 积分:1
-
sf_2014320164457
数据结构中的许多东西,包括头文件、例题、习题等等(Data structure many things, including the header files, examples, exercises, etc.)
- 2014-04-03 15:24:34下载
- 积分: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
-
哈夫曼树解码和编码
哈夫曼树,基本的数据结构,用来编码和解码、用数组作为存储结构实现,
- 2023-04-13 11:00:11下载
- 积分:1
-
tree
求二叉树的深度:
给定一个有根二叉树,规定连接两个节点的每条边长度是1,定义树的深度为根到叶子节点距离的最大值。 (Description
给定一个有根二叉树,规定连接两个节点的每条边长度是1,定义树的深度为根到叶子节点距离的最大值。 )
- 2011-12-11 20:42:18下载
- 积分:1
-
LINK
建立链表的算法:
新节点链入表尾建立链表:
动态分配第一个节点变量;
用指针head 妥善保存链表第一个节点的地址值;
依次动态分配一个新节点变量;
将上一个节点的指针域指向新生成的节点;
循环3),4)步骤,直到所有节点均连入链表;
将最后一个节点的指针域赋值为0;
(Establish the list of algorithms:
The new node links footer build list:
Dynamic allocation of the first node variable
Keep the list head pointer of the first node address value
In order to dynamically allocate a new node variable
The domain of a node pointer to the new generation of nodes
Cycle 3), 4) step, until all nodes are connected to the chain
Pointer field will last node assigned to 0 )
- 2015-01-05 16:03:48下载
- 积分:1
-
HEAP
poj 实现堆结构的源代码。。。话说其实没什么实际功能好么(poj achieve heap structure of the source code. . . In fact, the actual function of saying okay nothing)
- 2013-11-21 23:03:15下载
- 积分: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
-
communication
VC简易通讯录,加强C的编程,熟悉链表文件的使用等。(Simple VC contacts, strengthen C programming, familiar with the use of a linked list file.)
- 2012-09-02 17:11:12下载
- 积分:1
-
abc
数据结构的稀疏矩阵的几部分操作,广工的课程设计(Sparse matrix operations)
- 2013-12-03 15:57:53下载
- 积分:1