Huffman Prefix Codes

Repeatedly merge the two least frequent symbols or subtrees to build an optimal binary prefix code.

This lesson has not been built yet.