仓库管理系统

数据结构中的最短路径的查询，适合初学数据结构的学生使用-failed to translate

ACM算法题集 基础算法教案.doc 算 法 设 计 题 集.doc 算法题集.doc-ACM algorithm based on algorithms title set lesson plans. Doc algorithm design problem sets. Doc title set algorithm. Doc

表达式求值，c语言，有运行bug,可供研究使用。-expression evaluates, c language, and running bug, available for study.

数据结构学习中遇到的二叉树的代码，运行快速-Study data structure encountered in the code tree, run fast

ADO直接读取数据库的编程实例-read directly ADO database programming examples

是数据结构书上的算法，都是比较经典的实现。-data structure is the book algorithm, which is a more classic realized.

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

数据结构的源代码和配套讲义，非常齐全，初学者非常实用。-Data structure of the source code and supporting notes, very complete, very useful for beginners.

pku acm上的3083源代码，不过没有解题报告-pku acm on the 3083 source code, but I did not report Problem Solving

北大大牛代码 1240道题的原代码 超级权威 -North Daniudi title code 1240 of the original super-authority of code