Huffman

说明：  线性链表的定义，遍历，查找，删除，排序。(Linear list definition, traversal, search, delete, sort.)

讲述数据机构的图论部分和程序设计的关系，适合学习算法的同学学习阅读，很不错的一本书。(Graph theory algorithm and programming)

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

迷宫问题，利用随机数自动生成迷宫，并自动进行探索。迷宫起点及终点由用户自己设定。(Maze problem, the use of random number automatically generated maze, and automatically explore. The starting point and end point of the maze is set by the user. 双语对照 )

一道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.)

在N*N的棋盘上(1<=N<=10)填入1,2,...N*N共N*N个数,使得任意两个相邻的数之和为素数. (In the N* N chessboard (1 < = N < = 10) filled 1,2, ... N* N total number of N* N so that any two adjacent numbers and prime numbers.)

数据结构习题答案，线性链表的实现与适用，数据结构：思想与实现2-9(Data structure exercises answer, linear linked list implementations with applicable data structure: Ideas and Implementation 2-9)

按照一定的输入求出二叉树的层次遍历，输出相应的结果(Calculated in accordance with the input binary tree traversal of the hierarchy, the output of the corresponding results)

算法设计的动态规划，贪心算法 操作系统的银行家算法等五个小程序(data)

使用不同的方法解决背包问题：本算法采用的是动态规划方法，比较好的解决背包问题。(Use different methods to solve knapsack problem: The algorithm is a dynamic programming approach, a better solution to knapsack problem.)