动态数组的实现

Its about the data structure Q-Its about the data structure Queue...

常用的hash算法APHash，该hash算法可以实现均衡分布，让数据均匀的分布在hash列表中-Commonly used hash algorithms APHash, the hash algorithm can achieve a balanced distribution, so that uniform distribution of data in the hash list

单比特树查找算法，是用于路由查找的，内含有路由查找相关资料-Monobit tree-search algorithm is used to identify the routing, which contain routing information Search

清华大学严蔚敏数据结构题集与答案（Ｃ语言版）-Tsinghua University, Yan Wei-min data structure set and answer questions (C language version)

利用Access数据库制作的学生管理系统，可以方便的进行查询和其他管理。-use Access database produced by the student management system, to facilitate the conduct of inquiries and other management.

的地磅管理系统，还不错-the loadometer management system, but also good

数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T"s average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of

这是俺编写的一个堆栈，采用模版函数编写，面向过程设计，供大家参考-I prepared a stack, using templates prepared function, process-oriented design, for your reference

一个简单的数据库管理系统,是用delphi开发的.-a simple database management system, is to use Delphi development.

用VB sql2000 做的一个学生信息管理系统-VB sql2000 to do with a student information management system