sort

求二叉树的深度: 给定一个有根二叉树，规定连接两个节点的每条边长度是1，定义树的深度为根到叶子节点距离的最大值。 (Description 给定一个有根二叉树，规定连接两个节点的每条边长度是1，定义树的深度为根到叶子节点距离的最大值。 )

各种数据结构代码,欢迎下载,里面有JAVA,C,C++等等各种版本(Data structure and code, please download)

二叉树的中序遍历，先序遍历以及后序遍历的算法(Binary tree in preorder traversal, preorder traversal and postorder traversal algorithm)

Polynomial基于数据结构的思想,文件比较小,可以直接运行(Polynomial based on the idea of ​ ​ data structures, file is relatively small and can be run directly)

用C语言实现的普通快速排序，和随机快速排序进行对比(With ordinary C language implementation of quick sort, quick sort and compare the random)

队列的顺序存储结构和操作实现 队列的顺序存储结构和操作实现(The order of the queue storage structure and operation of the order of the realization of the queue storage structure and operation of the realization of)

Polynomial基于数据结构的思想,文件比较小,可以直接运行(Polynomial based on the idea of ​ ​ data structures, file is relatively small and can be run directly)

邻接表存储图，然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)

本代码是通过C语言来实现贪心算法求着色问题,包括具体问题和实现代码(This code is the C language to implement the greedy algorithm for the coloring problem, including specific issues and the implementation code)

几个比较好的初级算法，初学者可以看一下思想，对算法入门(A few good elementary algorithms, beginners can look at thinking on algorithms entry)