Huffman encoding decoder
no vote
Application background A complete system should have the following features: (1) I: initialization: read characters from the keyboard set size n, and n characters and N weights, the establishment of Huffman tree, and save it in a file HFMTREE. (2) E: encoding: the use of Huffman Ki (such as not in memory, then read from file HFMTREE), the text of the document TOBETRAN encoding, and then the results are stored in the file CODEFI