Question: how are huffman trees used for compression?
Answer: Huffman Tree achieves compression through the use of variable length code. ... To acheive compression, we can use a shorter bit string to represent a more frequently occuring characters, and a longer bit string to represent a less frequently occuring characters.