Binary tree structure, the binary tree in order, preorder, postorder

项目描述: SQLite is a small C library that implements a self-contained, embeddable, zero-configuration SQL database engine. Features include- Project description: SQLite is a small C library that implements a self-contained, embeddable, zero-configuration SQL database engine. Features include

用链表来实现的一个学生成绩管理管理系统，操作简单，清晰明了。-With a list to achieve the management of student achievement management system that is simple, clear.

这是一则无刷新发帖的实例，也是对Ajax的一个实际应用，后台是Apache+PHP,数据是文本(之所以考虑文本方便，数据库的话还要先安装，反而搞的复杂，所以采用文本。当然了，实际应用当中是采用MySql还是文本可以另选)-This is a refreshing post had no examples of Ajax is also a practical application, the background is a Apache+ PHP, the data is text (the text is having convenient, if the database should be installed, but are engaged in complicated, so use a text . Of course, the practical application of which is used MySql or text can elect)

这个是快速排序法的算法实现-This is a rapid method of sorting algorithm

题目：设有一航班售票系统，要求完成以下功能： 1）假设该民航有若干航班，要求实现增加航班和取消某个航班的功能。 2）查询：根据用户提出的终到站查询航班号、售票情况等航班信息；也可根据航班号，列出该航班已订票的乘客名单。 3）订票：根据航班号为客户订票，如该航班有余票，则为客户订票；如该航班已满员，则显示相应信息。 4）退票：按乘客要求退出已预定的机票。 -Topic: First flight with the ticketing system, required to complete the following functions: 1) It is assumed that the Civil Aviation have a number of flights, calls for increased flights and cancellation of a flight functions. 2) query: Based on user queries raised by the end of the arrival flight number, booking flight information, etc. also available under the flight number, listed in the flight

VC进行数据库编程，MFC编写的，可以与CListCtrl控件配合使用-VC database programming, MFC prepared can be used in conjunction with the CListCtrl control

vfp数据库应用编程-Probe Database Application Programming

数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T"s average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of

vfp数据库应用编程-Probe Database Application Programming