And the nodes other levels all have non-null subtrees

3. For a node with index p, what is its i^th child’s index (if existed)?

4. For a node with index p, what is the condition that it has right sibling? What is its right sibling’s index?

1) design Huffman coding for the eight letters and draw Huffman tree;

2) Calculate WPL of this Huffman tree.