树形结构的逻辑和存储特点。 二叉树的遍历递归算法。

倍增法构建后缀数组 求最大重复子串的C程序-Constructing the suffix array multiplication seeking to repeat the largest sub-string C-program

近期学习中的采购管理系统，数据库操作 -Recent study of the procurement management system ado sql

付款引擎是对作为服务器端的工作非常有用，如果你不是详见推数据到客户端，因为它的非常庞大的查询语法或庞大的数据，一旦时间需要显示在报表或网格中的应用。每次启动，它总是检查空闲使用计时器。它的使用 delphi 与 MySQL 的后端。

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

根据一棵二叉树结点的先根序列和中根序列构造该二叉树，并输出该二叉树的后序遍历结果。-According to a binary tree the root node of the first sequence and the sequence structure of the tree root and post the output of the binary tree traversal results.

索引文件操作（数据结构）-index file operations (data structures)

系统主要由考勤机和考勤软件两部分组成，考勤机集成了发卡机、读写器、和数据传输卡，可以脱离微机单独使用，其大容量、高可靠性的存储能力，足以应付人数众多的单位使用；高度集成、功能强大的考勤软件让原本枯燥、繁琐的考勤管理变得轻松、愉快 -System primarily by attendance and attendance software is composed of two parts, attendance card issuing machine integrates machine, reader, and data cards from the computer can be used independently, its large capacity, high reliability, storage capacity, sufficient to meet the large number of the use of the units highly integrated and powerful time and attendance software allows the original boring, tedious attendance management becomes easy, pleasant

数据结构中，发现两个字符串中最大匹配的字符的相关程序-Data structure, we found two strings of characters in the biggest match of the relevant procedures

这是一个简单的实用程序，允许您在不安装MS access的情况下压缩和修复access数据库。对于使用commondialogs和简单的文件复制/删除以及compact&；repair例程的示例来说，它也很好。

八皇后问题 文本界面-eight Queen"s text interface issues