打开

关于数据库的源代码。适合初学者参考如何使用数据库。-With regard to the database source code. Suitable for advanced users how to use the database.

每一个参加排列的数据对应二叉树的一个结点，且任一结点如果有左（右）子树，则左（右）子树各结点的数据必须小（大）于该结点的数据。中序遍历排序二叉树即得排序结果。-Order to participate in each of the data corresponding to a binary tree node, and any one node if there is left (right) subtree, then the left (right) subtree of the data node must be small (large) in the node data. Order traversal of binary tree that is the result of a sort.

用C++Builder写的数据结构队列问题的程序。希望对大家有用。-C Builder write queue data structure of the proceedings. We hope that the right useful.

这是一个有关数据结构的习题集，里面包含了有关数据结构各个章节的习题以及答案，可以方便同学们下载使用。-This is a set of exercises on data structure, which contains information about data structures, as well as answers to the various chapters of exercises, students can easily download.

在对本程序的快速排序和归并排序这两种算法的正确与否进行验证时，用手动输入的数据，本程序基本上完成了对输入数据进行的快速排序和归并排序!-in the process of the rapid sequencing and merging the two sorting algorithms are correct for the test, with the manual input of data, the procedure is basically completed the data entry for the rapid sequencing and merging order!

PB商场零售管理系统源码，无需解压密码，对需要的兄弟有所帮助-PB retail shopping center management system source code, without extracting passwords needed to help brothers

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

严蔚敏编写的《数据结构》第9章的答案，全部为源码-the answers of chapter 9 of a book called ‘Data Structures’ writen by Yan Wei Min

sqlite读写VC例子,很不错，值得收藏研究！-sqlite read VC example, it is good, worthy of study collections!

方便的数据库连接调试程序-convenient debugging procedures Database Connection