Encode "LEADEN" using the Huffman code tree given in the attachment.
 What can you say about a vertex in a rooted tree that has no descendants?
Please see the attachment for more tree related problems.
 To find the code for a letter, put together the edge labels in the order of traversal, when going from root node to the leaf node marked with respective letter. This ...
Solution explains the process of finding code for a letter, to encode it using given Huffman code tree. It also gives the criteria to categorize tree vertices into root, intermediate and leaf nodes.