← back to archive
Huffman Coding Visualizer
Optimal prefix-free binary encoding through greedy tree construction
// Input Text
Samples:
// Compression Statistics
0% (max compression)
100% (no savings)
// Huffman Tree
Step 0 / 0
// Character Frequencies & Codes
// Decode Binary
Enter a binary string to decode using the current Huffman tree
Decoded text will appear here...