数据库课程设计,设计一个订户订阅报刊的应用系统

电子白板代码（JAVA)-Whiteboard code (Java)

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

BDijkstra算法的java实现。使用工具是eclipse，java1.4以上-BDijkstra algorithm to achieve the java. Eclipse is the use of tools, more java1.4

给予B/S模式在线选课系统1. 用ASP/JSP+SQL Sever实现 2. 写出详细的需求分析 3. SQL代码、网页代码+截图-Given the B/S model online courses system in the ASP/JSP+ SQL Sever 2 write detailed requirements analysis 3 the SQL code, web page code+ screenshots

数据结构的经典示例

VC下ADO开发实践，整理总结的一片文章，可以按照其说明学习在VC环境下的ADO数据库应用程序开发-VC developed under the ADO practice, finishing a summary of the article, you can note in accordance with their learning in VC environment ADO database application development

MSP430F5系列TI官方源码，供学习430单片机的参考用。-TI Series MSP430F5 official source for the study of 430 single-chip reference.

VC++语言实现与数据库连接的源代码，效果不错的-VC++ Language database connection with the source code, the effect of good

仅用数据结构中的单链表就可实现集合的交、并与两个集合之差，-Only data structure in a single list can realize cross-collection, and the difference between the two collections,

数据结构作业图的一些集合 上面有优先遍历 和用链表和堆栈来实现的算法-data structure of some operations plan sets priority traverse above and the use of linked lists and to achieve the stack algorithm