[Verse 1]
Data compression on my mind, gotta make it small
Huffman coding is the way, gonna beat them all
Start with frequency counting, every symbol gets a score
Characters appearing more get the codes that are short for sure
Build a tree from bottom up, merge the smallest two
Assign the zeros to the left, ones go to the right side too
Most frequent at the top, rare ones buried deep
Variable length encoding, that's the secret that we keep
[Chorus]
Huff-man code, short for more, long for less
Fre-quen-cy first, build the tree, compress
Left goes zero, right goes one, path shows the way
Optimal prefix, no confusion, that's how we save the day
Huff-man code, short for more, long for less
Fre-quen-cy first, build the tree, compress
[Verse 2]
Priority queue in action, minimum heap is king
Pop the smallest frequencies, let the merging begin
Create internal nodes, sum the weights as you go
Left child, right child, watch the binary tree grow
No code is prefix of another, that's the golden rule
Unique decodability guaranteed, David Huffman's tool
Greedy algorithm working, optimal every time
Lossless compression power in this rhythmic rhyme
[Chorus]
Huff-man code, short for more, long for less
Fre-quen-cy first, build the tree, compress
Left goes zero, right goes one, path shows the way
Optimal prefix, no confusion, that's how we save the day
Huff-man code, short for more, long for less
Fre-quen-cy first, build the tree, compress
[Bridge]
From root to leaf, trace the path
Binary digits do the math
E gets one bit, Q gets seven
Frequency distribution heaven
Average length minimized
Information theorized
[Verse 3]
JPEG uses it, ZIP files too
Everywhere you look, this algorithm's true
Shannon's entropy sets the bound
Huffman gets close to what's been found
Static tables or adaptive trees
Dynamic coding with such ease
Canonical forms for transmission
Perfect data compression mission
[Chorus]
Huff-man code, short for more, long for less
Fre-quen-cy first, build the tree, compress
Left goes zero, right goes one, path shows the way
Optimal prefix, no confusion, that's how we save the day
Huff-man code, short for more, long for less
Fre-quen-cy first, build the tree, compress
[Outro]
When you need to save some space
Huffman coding wins the race
Variable length, optimal scheme
Data compression living dream