Interpretation of Code Trees

A particular code word will be created by running from the root node to the symbol's leaf node. Any left-sided branch adds a 0 to the code word; every right-sided branch a binary 1. The required number of steps or the depth of this part of the code tree is equal to the code length.

The example mentioned above result in the following code representing the three symbols "a", "b" and "c":

         0 -- a
        10 -- b
        11 -- c

 <   ^   >