example-program

哈夫曼编码程序，实现计算编码学中哈夫曼编码程序的源代码。(Huffman coding procedures, the realization of computing science Huffman encoding procedure s source code.)

哈夫曼树，基本的数据结构，用来编码和解码、用数组作为存储结构实现，

拓扑排序 -打印输出计算机本科专业4年每学期的课表(Topological sort - computer printout of undergraduate curriculum of each semester for 4 years)

哈夫曼树可以使读者快速方便的查找所需文件(Huffman tree allows readers to quickly and easily find the file)

迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)

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

说明：  可以实现判断二叉树是否为完全二叉树、判断两棵二叉树是否镜像对称、求一棵二叉树的一个最长枝等功能(Can determine whether the binary tree is complete binary tree to determine whether two binary mirror symmetry, one of the longest seeking a binary tree branches and other functions)

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

对于数据结构每一章节的相应的练习题，巩固好数据结构(To consolidate data structure corresponding practice questions for each chapter of the data structure)

数据结构快速排序例程代码，只要按照例子就可以很容易加入到你的程序当中。(Data Structures quick sort routine code, just follow the example you can easily add them into your program.)