Huffman

USACO中的American heritage，用C++编写，运用了树的遍历知识(the American heritage of USACO, with C++ prepared, using a tree traversal knowledge)

运用二叉树求代数表达式的值，将代数表达式的每个符号用二叉树结点表示，遍历图的每一结点，按结点值得不同采用不同运算方式(Solving algebraic expressions binary tree)

1.建立两个有序得链表（带表头，用头插法）； //2.写一算法在单链表上实现线性表的ListLength(L)运算。 写一算法将单链表中值重复的结点删除，使所得的结果表中各结点值均不相同。 (1. The establishment of two ordered lists too (with header, with the first interpolation) // 2. To write a method to achieve a single linked linear form of ListLength (L) operations. Write an algorithm to list the value of a single node to delete the duplicate, so the results in the table are not the same as the value of each node.)

基于数据结构的图书管理系统，基本功能都有，可以拿来作为数据结构的课程设计(Based library management system data structures, basic function, can be used as a data structure of the curriculum design)

为了点分 求分下载好麻烦 c++二叉排序树(In order to find points dotted download good trouble c++ binary sort tree)

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

序列二次规划算法，能求解包含约束和无约束的问题，非常方便。(Sequential quadratic programming algorithm to solve constrained and unconstrained contain the problem, very convenient.)

霍夫曼编码实验报告，内含源代码，编码原理 (Huffman coding lab report, containing the source code, coding theory)

二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)

数据结构循环队列的实现 在visual c++6.0运行(Circular queue data structure to achieve the visual c++6.0 run)