Hoffman Tree VHDL Code. All credit goes to the other guy who uploaded this to this website.

利用哈弗曼树实现文件的压缩及恢复，学习数据结构的同学可以-The use of Huffman compression and restore files tree implementation, the students learn the data structure can look

哈弗曼树的压缩与解压缩，哈弗曼树的压缩与解压缩，-Huffman tree compression and decompression，Huffman tree compression and decompression

赫夫曼树：试构造一棵有n个叶子结点的二叉树，每个叶子节点带权为wi，则期中带权路径wpl的最小的二叉树-Huffman Tree: test construct an n-leaf nodes are the binary tree, each leaf node with a right to wi, then the period of the right path with the smallest binary tree wpl