binary trees sp lf sp lf sp lf figure sp growing the huffman treepart coding the message now that we have the huffman treehow do we code messagewe start by creating code tablewhich lists the huffman code alongside each character to simplify the discussionlet' assume thatinstead of the ascii codeour computer uses simplified alphabet that has only uppercase letters with characters is is and so on up to zwhich is space is and linefeed is we number these characters so their numerical codes run from to (this is not compressed codejust simplification of the ascii codethe normal way characters are stored in the computer our code table would be an array of cells the index of each cell would be the numerical value of the character for for band so on the contents of the cell would be the huffman code for the corresponding character not every cell contains