Welcome to the Huffman Playground!

This tool shows how Huffman's greedy algorithm builds an optimal code tree.

• Enter any text and click Generate Tree.
• The characters are added to a Priority Queue, sorted by frequency.
• Use the step controls to watch the two lowest-frequency nodes merge into a new tree.
• Hover over the final codes table to see the path in the tree.