chain operation and Primbetov algorithm demo, easily comprehensible algorithms.

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

创建和修改自定义的数据库-Create and modify selfdefined database.

结构分析程序2，用fortran90编写，主要用于结构分析-two structural analysis procedures used to prepare FORTRAN90, mainly for structural analysis

三种排序方法的动态演示，可以同时开启多个线程，同时用不同的方法进行排序，直观的判断不同算法的排序效率。-three sequencing method of dynamic presentations, it also opened a number of threads, in addition to the use of different methods for sequencing, intuitive judgment different sorting algorithms efficiency.

资源描述本代码比较适合初学者，刚接触过C++语言的童鞋，对代码不是怎么懂，可以参考学习。

SVG动态读取数据库并实时显示出来。该代码以通过后台读取时间实时显示出来，如果你需要读取数据库，请在Default.aspx中处理即可。-SVG Dynamic read the database and displayed in real time. The code to read through the background of real-time display of time, if you need to read the database, please Default.aspx in treatment can be.

系统说明:这是一个应用数据库系统VFP开发的酒店管理系统.-system Note : This application is a database system developed by VFP hotel management system.

这是一道典型的动态规划题 提供了三种方法(用C++代码实现)-This a typical dynamic programming that provides three methods (using C code realization)

这是李春葆的《数据结构全书》的源码，亲测运行通过，比较适合自学数据结构，好东西当然不能独吞了，好评呦，亲！适合考研的同同学

用来输入姓名查询地址-used to input the names address inquiries