应用背景模板链表list，应用场景多。不过，尚有改进空间。如查找接口可以优化。关键技术模板链表，list模板、数据结构相结合。此代码在前人基础之上修改。

解决了BruteForce算法效率低下的问题，并且在该基础上完成了子串重复时的性能优化

unix上的ODBC实现-unix on ODBC to achieve

(1)利用普里姆算法求网的最小生成树 (2)实现教科书中定义的抽象数据类型mfset。以此表示构造生成树过 程中的连通分量。 (3)以文本形式输出生成树中各条边以及他们的权值-(1) the use of prim algorithm for minimum spanning tree network (2) the realization of the textbook definition of abstract data types mfset. Spanning tree structure to express the process of component connectivity. (3) to text output of all spanning tree edges and their weights

包含中序遍历二叉树的递归和非递归算法的源代码-Included in the sequence of recursive binary tree traversal and non-recursive algorithm source code

数据结构中经典的约瑟夫环问题的解法。-data structure classic Josephus the solution.

数据结构哈夫曼树-Huffman tree data structure

一元多项式的计算,建立两个多项式，并进行相加，相减运算，输出结果.参考资料：严蔚敏《数据结构与算法》-one yuan polynomial calculations, the establishment of two polynomials, and together, subtract operation, the output results. References : Yan Wei Min "data structure and algorithm"

这是一个有关于VC++6.0与数据库ACCESS相结合的小程序-This is a database on the VC++6.0 with a combination of small programs ACCESS

数据结构课程实验中所编的判断哈夫曼编码.参考可用-experimental data structure courses, which include the judgment Huffman coding. Reference available