做的非常好的论坛，数据库采用access。数据库在db文件夹下，在odbc注册db2000为系统DSN，就可以使用了...

使用powerbuilder开发的小型图书店系统。请查阅！-Use PowerBuilder to develop small-scale map Bookstore. Please check!

一款很使用的数据库代码-one is the use of the database code

c++链表模板类，实现所有链表的功能！包括增删改查，反转、递归反转等功能。对数据结构初学者有极高的参考价值。且代码规范，命名规范，有很多注释帮助理解。

在DOS环境下的最小二叉树程序，比较简单，可供大家学习参考-DOS environment in the smallest binary tree procedure is relatively simple for everybody to learn the reference

数据结构课程设计,表达式求值.大家看看,如果功能不好再找我修改-Data structure design, the expression is evaluated. Let us take a look, if not find my modified function

2.[问题描述] 编写递归算法，在二叉树中求位于先序序列中第K个位置的结点 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g 。输入要求的位置 [输出] 若二叉树不空，按先序序列输出，求出所求位置的结点 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，先序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点并计算出二叉树中叶子结点的数目和第K个位置的结点 #include #include struct node{ char info struct node*llink,*rlink } typedef struct node NODE -2. [Description of the issue] to prepare recursive algorithm, Binary for the first sequence sequence in the first position of the K-node [imported] in accordance with the first order input sequence in the order of the nodes content. Input abd eh i g cf. Import requirements of the position [output] if the binary tree is not empty, the first sequence by sequence output obtained by seeking the location of nodes [storage structure] Table 2 forks storage [algorithm for the basic idea] recursive method and Traversing binary tree. First established binary tree root node, and then to build t

离散点插值程序，采用的是cressman客观插值原理-discrete points interpolation procedure, the objective is cressman interpolation Principle

用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。-from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.

addlist very good please download it

数据结构和算法,C++描述，数据结构习题，数据结构答案-datastruct