Wang Yaohui Wang teachers given 178 classic c language source code

该系统实现以下需求： 1、  编辑一个学生籍贯信息记录簿，每个学生信息包括：学号，姓名，籍贯。 2、  创建一个链表用来记录学生籍贯信息，并以磁盘文件保存。 3、  读取磁盘文件并显示输出所有学生的籍贯信息。 4、 

建立VCL连接数据库,也是初学者的好东东，忘了如何写的回头看看也不错-VCL connection to establish a database, but also good for beginners Dongdong, forgot how to write back and look at the good

ACCESS常用窗体查询，例举多种窗体查询的方法-ACCESS commonly used form inquiry, examples of a variety of form queries

本源码属于mysql开源数据库的中文帮助文档，设计sql的基本操作，和mysql特定的规范。-This source belongs to the Chinese open-source database mysql help documentation, design sql basic operations, and the mysql-specific norms.

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 large operations- variable length record library

用delphi开发的一个数据库浏览器-with the development of a database browser

一个有关于C++6.0与ACCESS数据库相关的小程序-1 on C++6.0 and the ACCESS database-related applets

网络最短路径Dijkstra算法-network Dijkstra shortest path algorithm

数据结构课程设计,表达式求值.大家看看,如果功能不好再找我修改-Data structure design, the expression is evaluated. Let us take a look, if not find my modified function