Introduction - If you have any usage issues, please Google them yourself
Huffman encoding and decoding (Huffman coding, binary tree)
[Problem Description]
An article in English (more than 2000 characters), statistics of the number of characters to achieve Huffman coding and decoding of encoded results.
[Basic requirements]
(1) output and the number of occurrences of each character code, for which the minimum requirement of the right to use Heap.
(2) After the Huffman coding, coding table and save the results to a file coding article in English, the encoding results must be in binary form, that is, information 01 represented by bit, can not use the characters 0 and 1 indicates .
(3) provides read encoded file generation capabilities of the original document.