Introduction - If you have any usage issues, please Google them yourself
Experimental data structure: a design based on Huffman data compression program, to establish the corresponding Huffman tree based on the frequency of a given file to be compressed characters appear constructed Huffman coding table, on this basis, can be treated archive compression (ie coding), while binary-coded compressed file to decompress (ie decoding)