一个哈夫曼编码和译码程序

1、掌握树、森林和二叉树的概念和它们的特性以及它们之间是怎样相互转换的，理解二叉树的三种遍历：先序遍历、中序遍历和后序遍历，和树的两种遍历：先序遍历和后序遍历。

2、理解二叉树的基本运算算法实现以及它的非递归运算算法和层次遍历算法，了解二叉树的线索化及其它的应用。

3、掌握树和二叉树的几种存储结构以及它的构造，学会使用二叉链表实现二叉树的存储验证和设计相关算法。

-A Huffman encoding and decoding procedures for a master tree, forests and the concept of binary trees and their characteristics and how the mutual conversion between them, and understand the three kinds of binary tree traversal: preorder traversal, in order traversal and postorder traversal, and the two kinds of tree traversal: preorder traversal and postorder traversal. 2, understanding the basic binary tree computing algorithm and its computing algorithm and the level of non-recursive traversal algorithm to find clues of a binary tree, and other applications. 3, master of several trees and binary storage structure as well as its construction, learn to use two forks to achieve binary linked list of storage verification and design-related algorithms.