data structure

一个简易的ACCESS的源程序 VB源码-数据库-ACCESS a simple VB source code- database

实现KMP算法。 经典的模式搜索算法。-KMP algorithm realization. Classical algorithms.

学生管理系统功能的信息量大，数据安全性和保密性要求最高。本程序可实现这些功能。1)输出学生成绩单2)按姓名查询3)增加学生4)删除学生5)按班级修改学生成绩6)显示不及格学生成绩7)按平均成绩排序并输出成绩

本文介绍了数据结构中的选择排序，希尔排序等算法，采用全英文版，真实可靠-This paper introduces the data structure of choice, in order of ranking algorithms such as Hill, was used in English, true and reliable

Implementing a queue data structure

石头剪子布的游戏，六个文件组成适合初学者-rock scissors cloth games, six files for beginners

数据结构答案2，经多次修改而成，比答案册的还要简单清楚。-answer two data structure, several revisions, the book also answers simple and clear.

编译程序时使用最短路径,定义类,然后对类的实现,找出最短路径!-compiler to use the shortest path, a class definition, and then the right type and to find the shortest path!

功能强大的查询系统操作方便易懂好用不会繁琐数据库也强大-Powerful query system will not be easy to use easy-to-understand red tape is also a powerful database

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