data algorithm, the cooler East problem

这是一本介绍面向对象数据库的书，对学习数据库的朋友们很有帮助。-This is an introduction of object-oriented database of books, to learning database helpful friends.

酒店住宿管理系统,有完整的文件和源码, 可以下载使用-hotel management system, complete documentation and source code can be downloaded for use

哈夫曼编码/译码 利用克鲁斯卡尔算法计算信息的哈夫曼编码，以便更好的利用通信信道。-Huffman encoding/decoding algorithm using Kruskal Huffman encoding of information in order to better use of communication channel.

利用TreeCtr控件访问数据库-use TreeCtr controls access to the database

Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM). -Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM).

一个简单的数据库管理工具，可以管理Oracle等- A simple data bank administration tool, may manage Oracle and so on

全国计算机等级考试四级上机的部分练习题，配有我自己写的算法，算法说明和输入输出文件，使实验起来更容易。算法比较简洁易懂，大概有三十题左右（已经去掉了重复和类似的），对考四级的朋友和正在学习C的朋友会有帮助的-National Computer Rank Examination four aircraft on the part Exercises, equipped with my own writing algorithm, the algorithm description and input and output documents, and make it easier to experiment. Algorithms easy to read, there are about 30 or so that (already removed the duplication and similar), the examination of the four friends are learning C and friends can be helpful

ADO 数据库编程　用ACCESS 数据库系统-ADO Database Programming using ACCESS database system

墨香完整数据库 如果哪位大大有 请你 send edwinking094@gmail.com 给我因为我的墨香数据出问题 急找大大帮助我~

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