哈夫曼树的应用和实现 通过构造哈夫曼树及哈夫曼编码，掌握树型数据结构的基本实现方法。-Huffman tree application and by constructing Huffman tree and Huffman coding, to master the basic method tree data structure.

给定n个权值作为n的叶子结点，构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树(Huffman Tree)。哈夫曼树是带权路径长度最短的树，权值较大的结点离根较近。-Given n weights as leaf nodes n, constructing a binary tree. If the right path length to a minimum, said such a binary tree for the optimal binary tre

数据结构实验：设计一个基于哈夫曼树的数据压缩程序，根据给定的待压缩文件中字符出现的频率建立相应哈夫曼树，构造哈夫曼编码表，在此基础上可以对待压缩文件进行压缩（即编码），同时可以对压缩后的二进制编码文件进行解压（即译码）-Experimental data structure: a design based on Huffman data compression program, to establish the corresponding Huffman tree based on the fr

构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树-Construct a binary tree, if the weighted path length to a minimum, so called binary tree is optimal binary tree, also known as Huffman