We already know that the in-order sequence and the postorder sequence of a certain binary tree are D, G, B, A, E, C, H, F and G, D, B, E, H, F, C, A, respectively. Draw this binary tree.
Suppose a text transmitted is composed of 10 different characters, the frequencies of which are 8, 21, 37, 24, 6, 18, 23, 41, 56, 14, please design the corresponding Huffman encoding for these 10 characters.