polynomial

二叉树的建立 中序遍历二叉树 把二叉树转换成双向链表(Binary tree in the establishment of traversing Binary conversion to binary tree into a doubly linked list)

说明：  、实验目的 1 熟练掌握各种内排序方法，深刻理解排序算法及其执行过程； 2 学会分析各种内排序算法的性能； 3 了解各种排序方法的优缺点，对于实际问题能够选择一种较好的排序方案； 4 熟练掌握图的存储结构； 5 掌握图的邻接矩阵和邻接表表示分别进行深度和广度优先搜索遍历的算法。 6 了解图的最小生成树算法。 (Proficiency in the order of search, binary search and index search basic search algorithm, these algorithms are familiar with what kind of storage structure suitable for implementation two master binary sort tree characteristics, building methods, and dynamic search algorithm 3 master hash table of characteristics and construction methods.)

选择排序的实现，是一种基本的排序方法，但是时间复杂度相对较大。(Select Sort realization, is sort of a basic, but relatively large time complexity.)

说明：  哈希表，用c++语言编写，可操作运行，结果正确(Hash table, using c++ language, operational run, the results are correct)

本算法用于实现二叉树的查找和输出，使用了数据结构中的二叉树结构，精髓在于使用了函数指针。( This algorithm is used to find and implement binary output, use the data structure of the binary tree structure, the essence is the use of function pointers.)

这是一个二叉树左右子树交换的简单程序，希望对大家有用！(This is a binary tree so the simple sub-tree exchange procedures in the hope for all of us!)

说明：  图的相关操作：建立图，图的遍历，查找元素，删除元素等(Map-related steps: the establishment of map, graph traversal, find elements, delete elements, etc.)

这是acm高手楼天城的比赛代码，很有用哦，对于提高算法非常有用(This is a master of building Tiancheng acm game code, very useful oh, for improving the algorithm)

数据结构中数据的排序示例,包括堆排序、快速排序等(Data structure to sort the data sample, including the heap sort, quick sort, etc.)

插入排序与合并排序的算法比较，比较两种算法的优劣(Comparison of insertion sort and merge)