这个是数据结构中一定有的哈夫曼的实验

合同管理系统源程序,对报表打印数据备份与恢复等技术进行应用。-Contract management system source code, for printing statements, such as data backup and recovery technology for the application.

实现多课程的排序问题，符合先修课程安排的要求，可给出多种排课方案！！本程序的亮点是可得出一组课程的所有可能的拓扑排序,故最终结果是多方案的-Scheduling multi-course meet the requirements of Pre-curriculum can be given a variety of arranging schedule the program! ! The highlight of this program can be drawn from a group of courses in all possible topological sort, so the end result is a multi-program! !

初学实例:学生选修课及成绩管理系统,部分功能有待改善,菜单部分未完成-Examples of learning: students elective courses and performance management systems, some functions need to be improved, the menu part of the unfinished

经过改进的C语言位操作功能-improved C-language feature

C 语言开发HNT格式数据库系统 -boosted the development of C language format database system

自己帮家里人写的一个废品收购管理数据库系统，数据库用的access，界面用的VC-To help people write their own home to buy a waste management database system, the database used access, interface with the VC

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

数据结构的教程-data structure Guide

图论经典算法，包括最短路径，最小生成树，强联通分支等-Classical graph theory algorithms, including shortest path, minimum spanning tree, strong branch of China Unicom, etc.

南开大学  金属融化问题  辛运帏老师  C++实现  含测试样例