Please note that the Huffman encoding algorithm can be found on the web.

Huffman Code Example

Table from example in Huffman coding (Wikipedia)

Char	Freq	Code
space	7	111
a	4	010
e	4	000
f	3	1101
h	2	1010
i	2	1000
m	2	0111
n	2	0010
s	2	1011
t	2	0110
l	1	11001
o	1	00110
p	1	10011
r	1	11000
u	1	00111
x	1	10010

Huffman Tree

This a partial tree of the above character frequencies. Please fill in the remaining nodes.

Note that:

• the shorter paths are reserved for the higher frequencies
• each path is unique (root to leaf node path)
• a path can not be the beginning of a another path (that is why they are unique paths)