1

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

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

实现对二叉树的操作：建树、遍历、求层高、叶子数和结点数等(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.)

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

数据结构中KMP算法c语言实现，vc6.0环境(KMP algorithm in c language data structure, vc6.0 environment)

数值计算方法中高斯主元素消元法 在vc环境中运行 用于解方程组(Numerical methods in the Gaussian elimination method, the main elements of the environment in vc run for the solution of equations)

北邮数据结构课程设计大作业之旅行模拟查询系统。可实现多线程多旅客、中途更改计划、动态显示旅客状态等多个需求。已通过验收。(BUPT curriculum design travel query system simulation of large operations. Multithreading enables passengers to change plans midway, dynamic display multiple demands guest status. It has passed inspection.)

Monkeys and peach,Monkeys and peach(Monkeys and peach)

二叉树的C++实现，成员可以自己调整，实现了各种修剪此树的方法：初始化，增加节点，删去节点，复制树，读取节点，遍历树(Binary tree in C++, members can make their own adjustments to achieve a variety of pruning this tree methods: initialize, add nodes, delete nodes, copy the tree, read the node, traverse the tree)