程序分析，主要功能有，但界面还没加上，基本实现了功能要求。...

安徽工程科技学院 2009年计算机07级数据结构课程设计题目及要求-Anhui Institute of Engineering and Technology in 2009 a computer 07 data structure and requirements of the subject curriculum design

VC++程序实现读写EXCELL数据,可以演示执行代码-VC++ Program Excel to read and write data, you can demo the implementation of the code

我写的数据结构小程序是关于排序算法的，功能比较全-I write the data structure of small programs algorithm, the entire comparison function

广义表的头文件简单实用，一般般的操作都有说明。-Generalized table header file is simple and practical, generally have been described as the operation.

ACM解题报告，必有有用，特别对于初学者，看是否对你有帮助-ACM problem-solving report, there must be useful, especially for beginners to see if there is help for you

一个生成树的源码，不是很复杂，但是用什么来支付数据结构的操作也可以

数据库监视备份软件客户端通信软件广播状态参数 当前的主库(DWORD)+当前的状态(DWORD) -Database to monitor the backup software client software radio communication parameters the current state of the main library (DWORD)+ Current status (DWORD)

数据结构课程设计，指针，连表等等的应用．属于基础知识 -Curriculum design data structure, pointer, and even the application form and so on. Belong to the basic knowledge

实现网上书店基本功能：浏览图书，查询图书，添加图书，图书销量统计等。-Realize the basic functions of online bookstore: browse books, inquiries, books, adding books, book sales statistics.

数 据 结 构 大型 作业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