Introduction - If you have any usage issues, please Google them yourself
1 basically completed the compression and decompression code implementation.
Decompression is the key stream file operation, read the byte by byte read and the 0- 255 decimal integer transformation as a binary number, using the binary number starting the root node of the Huffman tree, 0 go left, 1 walk right, find a leaf node, the subscript of the leaf node is written to a new file, the effective number of bits 8 bits of the byte discontent