Campus e cartoon in database design and system page design, server

数据结构中的几种基本结构的C++实现：栈、队列、链表-data structure of several basic structure of the C achieved : Stack, Queue, Listless

枚举lan中的所有数据库实例的d-enumeration of all database instances d

以栈模拟停车场，以队列模拟停车场外的便道，按照从终端读入的输入数据序列进行模拟管理。每一组数据包括三个数据项：汽车到达或离去的信息、汽车牌照号码以及到达或离去的时刻。对每一组输入数据进行操作后的输出信息为：若是汽车到达，则输出汽车在停车场内或便道上停车位置；若是汽车离去，则输出汽车在停车场内停留的时间和应缴纳的费用（在便道上停留不收费）。栈以顺序结构实现，队列以链表结构实现。

VC++程序实现读写EXCELL数据,可以演示执行代码-VC++ Program Excel to read and write data, you can demo the implementation of the code

简单的通讯录程序-simple correspondence procedures

数值计算源代码，包括二分法，弦截法，龙贝格算法，下山法，牛顿迭代法-numerical source code, including the dichotomy, chord sheet, Lung Bergh algorithm, the mountain, the Newton iterative method

数据结构实习 迷宫求解-data structure internship Maze Solving

清华版数据结构实验要求的的哈希算法原程序-version Qinghua Experimental data structure requirements of the original Hash Algorithm procedures

1.[问题描述] 编写递归算法，计算二叉树中叶子结点的数目 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g . [输出] 按中序序列输出，输出的结果为；dbheaficg并计算出二叉树中叶子结点的数目为4 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，中序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点。根据左右子树的最后一个结点计算出二叉树中叶子结点的数目。 程序如下： #include #include #include"stdlib.h" -1. [Description of the issue] to prepare recursive algorithm, Binary calculation leaves the number of nodes [imported] in accordance with the first order input sequence in the order of the node contents. Input abd eh i g cf. [Output] by the order sequence output, the results of the output; dbheaficg calculated Binary leaf node to the number four [storage structure] Table 2 forks storage [ The basic idea algorithm] recursive method and traverse binary tree. First established binary tree root node, and then to build their son around the tree, the tree until the loopholes, which preorder binary tree, Li first times the left sub-tree, right af

数据结构实验课中的所有实验程序，这可是本人逐个测试过的，绝对精品，-experiment data structure of all experimental procedures, but I individually tested, absolute masterpieces,