Building a Huffman Compression Tree

In the modern digital world with finite bandwidth, compression and decompression of data are very useful techniques. A simple compression algorithm is based upon building a Huffman tree. Each leaf node in the tree corresponds to a unique binary code for the compressed data.

C# (100.9 KB)
1,495 times
Add to favorites
E-mail Twitter Digg Facebook