VC + SQL数据库编程 人事、工资、部门管理 包含SQL备份文件及部分源码注释...

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

药店管理系统；

关于 Datareport 的使用-the use of Datareport

这是研究生课程计算方法与技术中讲到的Prime算法的具体实现，相信学这个课的同学都会感兴趣的。-This is the postgraduate courses calculation methods and technologies referred to the Prime algorithm to achieve specific, I believe that this course of study students will be interested.

求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵 (3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。 (4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同 (5) 显示结果要清晰易懂 (6) 本题运行结果 -Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q

一些数据库的程序，可以在初次使用这个数据库时简单的使用-Some database programs, you can use this database in the initial use of a simple

用C#语言编写的访问Access数据库的程序，主要的特点是可以在treeview上显示，并添加，删除，编辑，treeview上的节点。

c语言编写，利用六种方法进行排序运算，以此对比各种排序方法的特点，包含源程序和课程设计报告。-c language using the six methods of sorting operations, thus comparing the characteristics of a variety of sorting methods, including source code and curriculum design report.

所有的VB数据库连接，添加、删除、修改技术，实例齐全，以ACCESS数据库为例！-database basic

hash 文件操作（数据结构）-hash file operations (data structures)