完成非的过程

栈的基本操作，有初始化，清空，添加，删除，判空等!-stack the basic operation, initialization, emptied, add, delete, subcontracting air!

全国交通算法,求最短路径,最省时间,最少工作量. VC开发的,很有借鉴意义-National transport algorithm for the shortest path, least time, at least workload. VC developed referential significance

数学表达式计算和解析 用c语言编写的,内含有例.速度较快-Mathematical expression of the calculation and analysis using c language, contains Example. Fast

成绩查询系统，实现系统的登录、选课、成绩查询等功能。-Inquiry System performance to achieve the system registry, selection, features such as query results.

Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM). -Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM).

这是一个PB小程序　是实现模糊查询的.这是一个PB的小程序，实现模糊查询的 这是一个PB的小程序，实现模糊查询的-PB This a small program is vague inquiries. This a small program PB, Fuzzy inquiry, which is a PB of small programs to achieve fu zzy inquiry, which is a PB of small programs to achieve fuzzy inquiry, which is the one PB small program for the realization of fuzzy

aql介绍，适合入门者学习 aql介绍，适合入门者学习-Aql introduction, suitable for beginners to learn Aql introduction, suitable for beginners to learn

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

银行家算法分析报告（ c语言）-bankers algorithm analysis report (c language)

用链表实现多项式的加法与乘法，链表是采用数据结构里面的单链表-polynomial with the addition and multiplication, linked list data structure is used inside the single-linked list