Select Code to Download

The Huffman algorithm pairs the sub-trees by weight. As long as there 
+are more than one sub-tree, pairs the lightest two into one sub-tree.
+ I chose to have the lightest branches on the left (bit 0). 

...
       /\  /\            sub-tree noted at its root) drawn on the left
+.
      D  EF  G

            49         For alphabet and:        27 A
            /\         and weights as so:       15 B
...

A=1   C=001   E=00001 G=00011
B=01  D=00000 F=00010

a 27 1
b 15 01
...
e 1  00101
f 1  00110
g 1  00111

a 27 1
b 15 01
...
e 1  00001
f 1  00010
g 1  00011