Some characters are more frequent than others and for them we can uses only one or two bits
Steps
- Calculate a frequency for each node
- Connect smallest numbers
- Assign 0 to left branches, 1 to right branches
- Each encoding is a path from the root
Huffman encoding
Creator
Creator
Seonglae ChoCreated
Created
2023 Nov 2 6:37Editor
Editor
Seonglae ChoEdited
Edited
2023 Nov 2 6:43Refs
Refs
Greedy Algorithm 
