| For compression, there is a lot of time lost if you have to search through the huffman tree for the character you want. Since this will be done _many_ times during compression for each character, it saves a lot of time to do it once and store the result in a code table. During decompression, yes, the code table is really redundant, but it is necessary during compression to avoid searching. |