Monkeys-and-peach

大学计算机专业，数据结构中的改进的KMP算法，C++编写。(University computer science, data structures to improve the KMP algorithm, C++ written.)

数据结构学习中提供的不错的源码，一个哈夫曼树类，利用了链队列存储结构。压缩包中有七个文件。(Data structure provided a good learning source, a Huffman tree class, the use of the chain queue storage structure. There are seven compressed file.)

演示进程调度算法 使用的链表 包涵7个功能 4个算法(Process Scheduling Algorithm Demo )

C语言树的简单实现,介绍了树你前序遍历，树插入与删除节点的实现(C-tree is simple to achieve, before you introduced the tree traversal, tree insert and delete nodes to achieve)

基于MFC平台，实现多功能计算器，可求解复杂表达式，主要实现为数据结构中链表和数组，对于要熟悉链表和数组的初学者有很帮助。(Based on the MFC platform, to achieve multi-function calculator, can solve complex expressions, the main realization of the data structure for the list and array, to be familiar with the list and the array of beginners helpful.)

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

用分治算法（O(nlogn)复杂度）实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))

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

数据结构 实验练习 删除相同的节点 希望会对大家有所帮助(Data structures lab exercises to remove the same node want to be helpful to everyone)

利用數據結構中的棧，實現19世紀著名數學家高斯提出的八皇后問題(Stack data structure, to achieve the eight queens problem of the 19th century, the famous mathematician Gauss)