内部数据结构课程设计的比较研究，共10…

K路归并算法，用贪心算法构造霍夫曼树，采用加入虚节点的思想求出最优的归并模式-K Road, merge algorithm, greedy algorithm using Huffman tree constructed using the idea of adding virtual nodes to derive the optimal merging pattern

易语言开发的，可以导入excel格式文件到指定数据库的student表中，并进行同名检查，再自动编号-Easy language development, you can import excel files to the designated student database table and check the same name, and then auto-ID

创建一棵二叉树，采用前序遍历的方法建立一棵树，传递的参数为一个指向结点的指针的指针，目的是为了解决传值的问题，输入@符号的时候，表示一棵子树结束线索化二叉树，寻找当前结点的后继结点，寻找当前结点的前驱结点，中序遍历 -create a binary tree using preorder before the establishment of a tree. transmission parameters of a point to the node pointer, the purpose is to solve the problem of traditional values, the importation of the @ symbol, said the end of a tree-binary tree of clues to find the current node"s successor nodes, for the current node precursor nodes, China preorder

这是研究生课程计算方法与技术中讲到的Prime算法的具体实现，相信学这个课的同学都会感兴趣的。-This is the postgraduate courses calculation methods and technologies referred to the Prime algorithm to achieve specific, I believe that this course of study students will be interested.

MFC实现的图书馆管理系统，希望对大家有用。-MFC library management system to achieve the hope for all of us.

skip-list 一种数据结构 一种图的表示方法-A skip-list data structure of a graph representation

是一个ibats和struts的整合的实例，包括多个数据库的代码，（有oracle，MySQL等）-Ibats and struts is a example of the integration, including a number of database code, (with oracle, MySQL, etc.)

NexusDB manual (chm format)

相关的库函数的说明！初学者很好用！-library functions related to the note! Beginners good use!