Type or paste any text to build its Huffman tree — see per-symbol frequencies, the resulting prefix codes, the encoded bitstring, and the compression vs. a fixed 8-bit encoding.