use Excel to read the data, the use of VC 6.0, containing "odbcinst.h"...

用于建筑的测斜数据处理!把测试设备的数据下载电脑,通过本系统进行分析,然后生成所需要的数据!-For construction of the inclinometer data processing! The test equipment data download computer, through an analysis of the system, and then generate the data needed!

数据库的应用，基于索引，实现一个简单的B+树搜索树 -Database application, based on the index, the realization of a simple B+ tree search tree

数据库操作类,封装了BDE数据库操作的所有方法。 编译环境 C++ Builder6 下通过。-database operations, a package of database operation BDE all methods. C compiler environment Builder6 through.

后缀数存储算法，利用后缀树(sufixtree)存储，搜索数据，可以达到C*O(n)的复杂度-suffix several storage algorithm, the use of the suffix tree (sufixtree) storage, search, which can reach C* O (n) the complexity

用C语言写的文件合并，可以合并两个二进制文件-Using C language to write the file merger can merge two binary files

此程序是利用图形函数画Lagranges函数，分段插值函数，Hermite函数的函数图形-This program is the use of graphics functions draw Lagranges function, sub-interpolation function, Hermite function is a function of graphical

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

R树与B树的混合树，在这个程序里面可以直接用R树和B树-R and B-tree tree of mixed tree, in the inside can directly with the R and B-tree tree

最简单和最酷的方式来创建类似程序，可以做与 ListView 保存、 加载和修改多个条目与文本的文件的数据库。必须下载此，请参阅如何最简单的这种方法是

资源描述数据结构课后题，图方面的代码，如DFS BFS dijistra prim kruscal等,对于初学算法基础课的学生有很大的帮助