Huffman coding

Home > Computer Science > Algorithms and data structures > Heaps and Priority Queues > Huffman coding

A lossless data compression algorithm that builds a binary tree from a frequency table and assigns codes to each symbol of the alphabet based on its frequency. It uses a priority queue to build the binary tree.