OTL4示例

ben wenjian shi tongguo yong cbainxie chengxu shixian-ben wenjian shi tongguo yong cbainxie Rezeption gxu shixian

用链表求300的阶乘,并且返回链表节点的个数.-used for the factorial 300, and returned to the linked list node number.

操作Ado，得到数据信息，包括表信息、字段信息-Get Database infomation , about Table or Fields.

八数码问题的C++实现，最经典的广度有限算法-eight digital realization of the C and classic algorithms limited breadth

多种方法解决全排列的问题 在vb环境下编写-various methods to solve all problems with the environment in preparation vb

这是一个在C环境下编写的链表操作，主要实现集合的交，并，补操作-This is an environment in C List prepared by the operation, main set of reference and that the fill operation

SQLite的包装库的源代码，4.7版本可与最新的PBWIN编译器中使用

很适合初学者《数据结构实验与实训教程》（PDG）.zip- Suits the beginner very much "Construction of data Experiment And Really Teaches Course" (PDG) zip

这是一个字符串到整型的转换，在很多程序设计中，这个小模块被频繁使用到。-This program implements the transformation of string to integer.This module is often used in many other program.

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