example-program

使用非递归的方法遍历二叉树，可以直接运行。( Non-recursive binary tree traversal.)

数据结构作业－停车场管理(operating data structure-the car park management)

使用C语言建立带头结点链表实现了集合。并进行了性能上的优化。(Achieve set using C to build list witch head node. And make optimization in performance.)

该ppt包含了栈和队列的数据结构及基本操作，同时还有栈的举例(This ppt contains the stack and queue data structure and basic operation, as well as examples of the stack)

图的遍历的实现，文字界面，包含深度遍历和广度遍历两种情况~~(Graph traversal implementation, the text interface, including the depth and breadth traversal traverse both cases ~ ~)

假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。） 对于给定的k 个待安排的活动，编程计算使用最少会场的时间表。 (Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.) K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)

说明：  数据结构中的顺序表，是其中的一个重要组成部分(The order of the table data structure is an important component of which)

一道poj上的问题的解答，棋盘上的距离问题。即实现棋盘上从一个点移动到王，后，兵之间最短步数的解答。(A poj answers to your questions on the chessboard distance problem. That is, move from one point to the king on the board, after the shortest number of steps between the soldiers answer.)

好用的平衡二叉树类库，C++类库编写， 好用的平衡二叉树类库，C++类库编写(AVL tree implementation for C++)

c语言编写链式线性表的初始化，创建，插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)