Description: Huffman coding key point is to construct a Huffman tree. The process is:
1 Enter each leaf node and frequency, for each node lchild, rchild, parent were given the initial value is 0
2 Select the parent is 0, and the smallest two nodes fre began to build the Huffman tree, and then modify the corresponding node lchild, rchild, parent values , so repeat until the Huffman tree created.
3 reverse request from the leaf to the root of the Huffman code for each node.
4 decompression, because Huffman coding is a prefix code, that any one character encoding to another character encoding is not the prefix, so according to code table we can easily extract.
To Search:
File list (Check if you may need any files):
huffman.doc
Download