heap

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

随机函数产生10000个随机数，用快速排序、直接插入排序、冒泡排序、选择排序的排序方法排序，并统计每一种排序所花费的排序时间和交换次数。其中随机数的个数由用户定义，系统产生随机数。(Random function generates 10,000 random numbers using quick sort, insertion sort, bubble sort, select Sort sort Sort, and statistics for each sort spend the sort of time and the number of exchanges. Wherein the number of the random number defined by the user, the system generates random numbers.)

简单的一个链栈.即用链表实现的一个栈。可以做简单的插入、删除、查找等操作(this is a simple C++ program )

二叉树实现，整个包为VS工程。包含了二叉树的基本功能(Binary Tree, the entire package is VS works. Contains the basic functions of the binary tree)

用于迷宫问题的解决用户根据根据要求进行设置即可在屏幕上显示(Maze problems for users in accordance with the requirements set can be displayed on the screen)

数据结构中图的存储结构的建立与搜索 建立图的二种存储结构 在不同的结构上实现遍历 (Data structure diagram of the storage structure of the establishment of the search to establish two kinds of graph storage structure in the different structures to achieve through)

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

该代码实现了深拷贝的问题，对于深拷贝进行了一系列的介绍，并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)

链表，输入一定的数据，通过链表进行储存，并排序后输出。(List。Input numbers,then output in order~~)

数据结构，利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)