这是一个有关数据结构的习题集，里面包含了有关数据结构各个章节的习题以及答案，可以方便同学们下载使用。...

教学管理系统 简单实用的校园学生档案管理系统-Teaching Management System Campus students simple file management system

读入树状结构,是计算机系c语言设计必考内容之一,大家应好好研究这个源程序-read into the tree structure of the Department of Computer Language Design c compulsory element, we should seriously consider the source

成绩查询系统，实现系统的登录、选课、成绩查询等功能。-Inquiry System performance to achieve the system registry, selection, features such as query results.

运动会分数统计系统 数据结构的课程设计-Games scores of statistical systems data structures curriculum design

参加运动会的 个学校编号为 。比赛分成 个男子项目和 个女子项目，项目编号分别为 和 。由于各项目参加人数差别较大，有些项目取前五名，得分顺序为7，5，3，2，1；还有些项目只取前三名，得分顺序为5，3，2。写一个统计程序产生各种成绩单和得分报表。 2、要求产生各学校的成绩单，内容包括各校所取得的每项成绩的项目号、名次（成绩）、姓名和得分；产生团体总分报表，内容包括校号、男子团体总分、女子团体总分和团体总分。 3、测试数据：对于 ， ， ，编号为奇数的项目取前五名，编号为偶数的项目取前三名，设计一组实例数据。 -The school serial number participating in Games is. Competition divides into men s event and women s event , the project serial number parts for the sum. The difference is bigger since every project participates in a number , some projects choose the first five , score order is 7 , 5 , 3 , 2 , 1 Still have some of projects taking the first three places , score only being 5 , 3 , 2 in proper order. Write a form for report counting procedure producing the various school report card and score. 2, demands the school report card producing every school , content includes every achievement project number , position in a name list (achievement) , full name and score per got by school Produce the group total points form for report ,

有关路由算法的程序，具体要求见压缩文件内容-Routing algorithm of the procedure, specifically asked to see the contents of compressed files

本文当为二叉树的演示程序，应用于学习研究-In this paper, as the binary tree demo program used in study

系统说明：这是一个应用VFP数据库系统开发的数据采集系统。-system Note : This application is a database system developed VFP data acquisition system.

堆排序:思想: 用二叉树的结构来表示数组,及用数组来表示二叉树的结构,比如i为父节点其孩子为,2i,和2i+1.其中,大顶堆中 父节点大于其两个孩子 算法平均时间复杂度: O(nlogn) -HEAPSORT: thinking: using binary tree structure to express the array, and used to express an array of binary tree structure, such as i the parent node for its children, 2i, and 2i+ 1. Among them, the big top of a pile of the parent node greater than two children on average time complexity of algorithm: O (nlogn)

在学习数据结构时，往往不知道那些结构与算法有何用，以及怎么用。这个小小程序充分显示了Huffman二叉树的应用。虽然其压缩效果比RAR相差甚远，但也能说明一二。 -the study data structure, they often do not know what the structure and algorithm, as well as how use. This little procedure fully demonstrated the application of the binary tree Huffman. Although the compression ratio falls far short of RAR, but can also explain on January 2.