ACCESS常用窗体查询，例举多种窗体查询的方法

实现网上书店基本功能：浏览图书，查询图书，添加图书，图书销量统计等。-Realize the basic functions of online bookstore: browse books, inquiries, books, adding books, book sales statistics.

这些是数据结构结构的经典实现算法，是学习数据结构必须掌握的-shu ju jie gou jing dian suan fa shi xian

这份是数据结构的一些资料，里面内容相对比较简单，但却非常值得一看～-This is some of the information data structure, which content is relatively simple, but very much worth a visit ~

战车问题 战车问题 战车问题 战车问题-The issue of the chariot chariot chariot issues issues issues chariot chariot chariot problem issues

.Net显示了友好的人机界面，以及非常少量的原代码就能够完成所要的功能-. Net shows the friendly human-machine interface, as well as a very small amount of the original code to be able to complete the function of

一个有用的数据库操作程序（用jubilder）-a useful database operations (using jubilder)

最短路径查询,用的是ESRI公司arcobject组件开发的,已经作成dll,用起来非常的方便-Shortest Path inquiries, the company is ESRI arcobject development of the components, make dll with it is very convenient

数据结构――C语言版配套源代码-Data structure- C language version of matching source code

K路归并算法 * 本程序用来实现K路归并算法 * 在Turbo C2.0编译器下编译通过 * 算法过程中 * K由用户输入 * 用户选择需要归并的数据的个数 * 由程序生成随机数据，数据结构为链表，并展示给用户 * 然后程序告诉用户需要增加的虚节点的个数 * 并把虚节点加入到链表中去，最后进行归并 -K Road merge algorithm* This procedure used to realize the way merging algorithm for K* in Turbo C2.0 compiler compiler under the process through the* algorithm* K* by the user input the user select the number of merging the data* generated by the random data , data structure for the list, and display to the user* and then the procedure to tell the user the need to increase the number of virtual nodes and virtual nodes* added to the list going, and finally to merge

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