倒置一个单链表，链表是带有头结点的单链表，通过不断在表头插入结点，使链表有序...

约瑟夫环问题，设计一个程序求出出列顺序 基于VISUAL C++开发-Joseph Ring problem, design a procedure to derive the column order based on VISUAL C++ Development

ssd7考试2的答案，自己做的，98分的-2 answers ssd7 examination that he did, 98 points

一个出勤的数据库系统，很实用的，欢迎大家下在-An attendance database system, it is practical, welcomed everyone in

直接存取Access97数据库文件(MDB)的工具库源码- Direct access Access97 database file (MDB) tool room source code

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

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

迷宫问题的一个简单程序，此程序简单易懂，很好理解，适合初学者看-Problem a simple maze procedure, this procedure simple and easy to understand, well understood, suitable for beginners to see

student select course system,powerbuilder做的，很容易实现 ,不会有人上载了吧-student select course system, powerbuilder done, it is easy to realize that no one on the right is contained

用二分法解高阶方程的近似解。区间范围合计算精度可调，每一步的计算结果一列表的形式显示出来，一目了然-dichotomy solution with the higher-order equation approximate solution. The scope of a range accuracy adjustable every step of the calculation results in the form of a list show up clearly

E-store CMU SSD7 EXE4答案. 实现要求全部功能 绝对满分-E-store CMU SSD7 EXE4 answer. All the functional requirements to achieve absolute perfect score