数据结构基础学习程序，在TURBO C++集成环境中使用，特别适合数据结构初学者参考使用...

Visual basic + sql server2000学员管理系统原代码-Visual basic+ sql server2000 student management system source

内部排序的所有算法，而且有相关可执行例子，包括插入排序，选择排序，希尔排序，快速排序，堆排序，归并排序等，很全，很孀。-sequencing of all internal algorithm, but is related to the executable examples, including insertion sort, select, in order of ranking Hill, the quick sort, heap sort, merging sequencing, all very, very widow.

严蔚敏数据结构的源c代码，非常的经典，很适合初学者的使用-YAN Wei-min data structure c source code, very classic, very suitable for beginners to use

train reservation in visual basic

利用c语言实现学生成绩的管理，主要功能有新生的登记注册、学生信息的修改、学生成绩的登记、学生成绩的修改、学生成绩单的格式打印等功能；本程序富含有背景操作等相关内容！

最小生成树，使用PRIM方法生成最小生成树。-Minimum Spanning Tree, use the PRIM method to generate minimum spanning tree.

采用stack算法的DFS搜索，有java做的界面，还有适当的注释-using stack DFS search algorithm, so java interface, the appropriate Notes

asp仓库管理系统，很实用的一个系统，功能都能实现！采用access数据库，简单适用-asp warehouse management system, a system is very practical, functional can realize! Using access database, a simple application of

数据结构 二叉树算法集合为学习数据结构的同学提供帮助　互相交流-binary tree data structure set for the learning algorithm data structure to help students exchange

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