ACRush_2_1

这是数据结构很重要的程序，主要是课后题的答案，和代码，功能很强大(the data struct of the book)

c语言编写链式线性表的初始化，创建，插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)

实现对二叉树的操作：建树、遍历、求层高、叶子数和结点数等(binary tree)

说明：  从最后一个非叶子结点开始从后往前进行调整，保证了根下的所有子树都是最大堆，最后对根进行调整，使整棵二叉树为最大堆，保证了根结点为整棵数的最大值点，完成了建堆的过程，再将根结点跟最后一个结点进行交换，如此反复操作，则堆排序就完成了，其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)

多项式求和，用链表实现的一元多项式求和程序，比较 靠谱(Polynomial sum, with the linked list implementation of a polynomial summation procedure, more reliable)

编程实现Prim算法，基于最小堆数据结构，生成最小代价生成树。 （其中随机生成点和边，形成连通图） 根据输入的顶点数的不同，分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected complete graph for given size n according to the following approach: 1) Randomly generate n points ( ) on a plane 2) Randomly generate k pairs of points as edges of the graph. 3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge. )

实现了多项式的创建，实现了多项式的加减乘除等基本操作(The realization of polynomial create, to achieve the polynomial add, subtract, multiply and divide the basic operation)

实现经典问题老鼠迷宫，并用坐标将路径显示出来(Achieve classic problem rat maze, and coordinate with the path displayed)

迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)

说明：  100米比赛排名 C++实现100米比赛排名 C++实现(100m rankings C++, the 100 meters ranks C++,)