• Huffman Coding

Huffman Coding

Find the best encoding by greedily combining the two least frequently appearing items. Optimal in terms of encoding one character at a time.

1. Sort letters on frequency or probability
2. Construct the tree by combining the two least frequent letters at a time

Back to Greedy Algorithms

Data Structures and Algorithms Table of Contents

---

anusha-murali.github.io