AutomobileCost

发货查询系统作业，delphi 写的,演示 数据库德操作和 打印输出-this is a test for delphi and access

自创的彼此交流账目软件，难得的好软件请一定要下来看看。-self-exchange accounts software, a rare good software must please look down.

一个sql语法分析程序- A sql grammar analysis program

第六章 模板与数据结构习题 6.2.1 需要编写一个对多维数组通用的算法（即各维的大小未定），怎样才能把实参多维数组的信息全部传递到函数中去？-Chapter VI with the data structure template 6.2.1 Exercises need to write a generic algorithm for multi-dimensional array (that is, the size of the peacekeeping undetermined), how can the real multi-dimensional array parameter information passed to the function all go?

c++写的一个关于数据结构的苹果纠纷的数学问题,相信会给喜欢数据结构的朋友们带来帮助!-c write a data structure on the Apple disputes the mathematical problem, I believe, would like the data structure to help bring friends!

和尚挑水问题（文件内有详细解释） 主要是回溯法的一个好的实例 自己摸索出来的-Monk carrying water issues (the paper has explained in detail) is primarily a good example of backtracking find their own way out of

前一阵出去玩了，补回还差的2个，里面包括上次上载的一共5个，另加个汇编程序，是课堂实验-play out a little while ago, to compensate for the worse two, including the inside on the last of a total of five, plus a 000 assembler, a classroom experiment

该源码功能是实现赫夫曼编码，即构造最优二叉树，是字符界面的，自我感觉做的还不错，调试通过的，绝对好用-The source function is to realize Huffman coding, that is, the optimal tree structure is a character interface, and the sense of self, to do good, debugging adopted, the absolute ease of use

2.[问题描述] 编写递归算法，在二叉树中求位于先序序列中第K个位置的结点 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g 。输入要求的位置 [输出] 若二叉树不空，按先序序列输出，求出所求位置的结点 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，先序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点并计算出二叉树中叶子结点的数目和第K个位置的结点 #include #include struct node{ char info struct node*llink,*rlink } typedef struct node NODE -2. [Description of the issue] to prepare recursive algorithm, Binary for the first sequence sequence in the first position of the K-node [imported] in accordance with the first order input sequence in the order of the nodes content. Input abd eh i g cf. Import requirements of the position [output] if the binary tree is not empty, the first sequence by sequence output obtained by seeking the location of nodes [storage structure] Table 2 forks storage [algorithm for the basic idea] recursive method and Traversing binary tree. First established binary tree root node, and then to build t

this is my first software.