全国计算机等级考试四级上机的部分练习题，配有我自己写的算法，算法说明和输入输出文件，使实验起来更容易。算法比较简洁易懂，大概有三十题左右（已经去掉了重复和类似的...

图书管理系统源代码及报告分析，图书管理系统源代码及报告分析-Library management system source code and reports analysis, library management system source code and reports analysis of

使VC连接数据库变的更简单-VC connect to the database so that a simple change

二叉树的各种操作，包括二叉树的建立，前序、中序、后序遍历二叉树，另外还包含一个霍夫曼编码的实现。-Binary tree of various operations, including the establishment of binary tree, the former sequence, in order, after the tree traversal, and also includes the implementation of a Huffman code.

医院门诊管理系统:它是由任天华完全自主开发的医院数据库管理系统，以病人就诊的流程中的站点为基本要素，使数据信息一体化、统一化的一个门诊管理系统。-it is by any Tianhua hospitalcompletely self-developed databasemanagementsystem for patients in the treatment processas the basic elements of the site to make data integration, unified management system of a patient.

图的深度优先算法，这个算法非常的实用，应该经常被用到-map the depth priority algorithm, the algorithm is very practical, should always be used

员工工资单计算。

windows下各种数据转换工具，能转换各种库-windows under various data conversion tools, can change all the

应用背景图论相关，图论相关算及其应用。邻接表，邻接矩阵 的实现方法，。。图论相关，图论相关算及其应用。邻接表，邻接矩阵 的实现方法图论相关，图论相关算及其应用。邻接表，邻接矩阵 的实现方法关键技术邻接表，邻接矩阵 的实现方法，C++源码 源代码，使用 VS 2010 C++源码 源代码C++源码 源代码 编写的，真麻烦

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

八皇后问题串行算法,可递推n皇后问题 C代码-eight queen question code