《数据结构与算法分析+C 2B 2B+描述+第三版》答案

旅客航班预订系统，可以实现预订、查询、退票等功能

最短路径算法源代码!用于mapx最短路径的算法!-Shortest path algorithm source code! For the shortest path algorithm MapX!

电梯模拟系统，电梯端和管理员端通过网络连接-Elevator simulation system, elevator client and the administrator client through a network connection

BM关键字查找算法，在用于查找子字符串的算法当中，BM（Boyer-Moore）算法是目前相当有效又容易理解的一种，一般情况下，比KMP算法快3-5倍。-BM keyword search algorithm used in the sub-string search algorithm which, BM (Boyer-Moore) algorithm is quite effective and easy to understand A, under normal circumstances, more than 3-5 times the KMP algorithm quickly.

该源代码为数据库设计的报刊订阅，和报告，挺详细的，适合初学者-The source code for the database design of newspapers and periodicals subscriptions, and reports quite detailed, suitable for beginners

这是数据结构中图的全部实现代码，对学习数据结构的同学很有帮助-this is a code of data structure

数据结构课程设计 AVL树等 希望对大家有帮助-AVL tree data structure, such as curriculum design, we want to help

书籍管理系统，SQL数据库课程设计，用C实现与SQL数据库连接实现书籍增加删除查询等功能模块，采用分模块法，论文与代码齐全，-book management system, SQL database curriculum design, realization of C and SQL database connectivity to achieve books increased inquiries delete function module, a sub-module, papers and complete code,

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

练习时做的一个老乡通信录管理系统,可从WORD中导入数据,存入ACCESS数据库中-Practicing to do a hometown address book management system can be obtained from WORD to import the data into ACCESS database