🧪 Huffman Coding Compression Tree
Build an optimal prefix-code tree by repeatedly merging the two least frequent symbols.
Algorithms & AI2DModerate60 FPS📱 Mobile-adapted🤖 ChatGPT
⚙ Under the hood
Build an optimal prefix-code tree by repeatedly merging the two least frequent symbols.
Canvas
2D · HTML5 Canvas 2D · 60 FPS target · runs fully client-side, no install