Six-degree-space

kd-树（k维搜索树）是把二叉搜索树推广到多维数据的一种主存数据结构。这里给出了其代码的VC++实现(Classic data structures- KD tree full implementation, with a detailed explanation of the code, the novice data structure good materials)

B-树的创建、插入、删除等一系列操作！(B-tree creation, insert, delete a series of manipulations!)

说明：  a set of uestc computer academic matu

讲解了循环单链表的建立，以及在链表中插入、删除、更改数据...(Explain the establishment of circular single linked list, and insert in the list, delete, change the data ...)

说明：  有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)

大学软件工程数据结构课程设计二叉树实验三种遍历方法(curriculum design,structure data)

POJ141的源代码，以空间换时间，速度很快很好用。(POJ141 the source code for time in space, fast easy to use.)

最小生成树两种经典算法,kruscal和Prim算法(spanning tree)

东北大学数据结构实验指导书,2014级东北大学软件学院软件工程专业(Experimental data structure, guide books, Northeastern University, Northeastern University School of Software 2014 Software Engineering)

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