← back to archive

Huffman Coding Visualizer

Optimal prefix-free binary encoding through greedy tree construction

// Input Text
Samples:
// Huffman Tree
// Character Frequencies & Codes

Build tree to see frequencies...

// Build Steps

Animate to see steps...

// Decode Binary

Enter a binary string to decode using the current Huffman tree

Decoded text will appear here...