Huffman Decoding: Prefix-Free Codes and Tree Paths

This activity develops the basic ideas behind Huffman decoding. It begins with fixed-length encodings, moves to prefix-free codes, and then uses a tree to decode a message one bit at a time.