申論題

4. Huffman tree : Huffimnan algorithm is a variable-length encoding method, in which a Huffiman tree is constructed. Suppose seven symbols A, B, C, D, E, F, G with frequencies 8, 15, 1, 6, 15, 3, 7, respectively, are given. You have to obey the following rules for constructing the Hufiman tree:

(2) When two nodes are merged, always set the node of label with less lexical order as the left child, and the other as the right child.