Question: Complete the implementation of the Huffman coding tree, building on the code presented in Section 5.6. Include a function to compute and store in a
Complete the implementation of the Huffman coding tree, building on the code presented in Section 5.6. Include a function to compute and store in a table the codes for each letter, and functions to encode and decode messages.
This project can be further extended to support file compression. To do so requires adding two steps: (1) Read through the input file to generate actual frequencies for all letters in the file; and (2) store a representation for the Huffman tree at the beginning of the encoded output file to be used by the decoding function. If you have trouble with devising such a representation,
see Section 6.5.
Step by Step Solution
3.39 Rating (155 Votes )
There are 3 Steps involved in it
To implement Huffman coding tree including functions to compute and store codes for each letter and functions to encode and decode messages you can build upon the basic Huffman coding algorithm Below ... View full answer
Get step-by-step solutions from verified subject matter experts
