with vb simulation procedures DBMS

VB6与三菱FX PLC 编程口通讯（遍历读FX-PLC的映象区）字号 操作状态CommExit: 0通讯进行状态,通讯被打断 通讯状态CommEnd:开始发送和等待接收,>1:接收串已结束-VB6 with Mitsubishi FX PLC Programming mouth communications (FX-PLC read traversal of the image area) to operate a state-established CommExit: 0 communication status, communication was interrupted communication state CommEnd: to start to send and waiting to receive,

《数据库系统实现》前四章，数据库实现的经典书，介绍了很多原理性的东西。-" Database system implementation," the first four chapters, the database to achieve a classic book describes the principles of a lot of things.

学校景点分布图最佳路径选择，通过最短路径选择让游者能够自由选择最佳观赏路径-schools attractions distribution choose the best path through the shortest path chosen You can watch free to choose the best path

二叉树请认真书写上传资料的详细功能、包含内容说明(至少要20个字)。尽量不要让站长把时间都花费在为您修正说明上。压缩包解压时不能有密码。 -yingge dfsafa fafsadf sadfhjsafsafksa

数据库课程设计要求-database design courses

这也是个数据库的编程，是演示如何连接远程的数据库的。-This is a database programming, shows how to connect to the remote database.

各种排序的程序，应用多种数据结构-various sequencing procedures, application of a variety of data structures

对文件进行文本文件处理 并采用递归法把查到的信息插入到树中-a file processing program, process a file and insert the information from the file to a tree

本代码实现并比较了直接插入排序，选择排序，冒泡排序，快速排序，两路合并排序，堆排序，同时可视化比较了他们的时间复杂度，代码完整可行，有可执行文件直接运行。

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