数据结构与算法 Huffman

1-1
Given a Huffman tree for N (≥2) characters, all with different weights. The weight of any non-leaf node must be no less than the weight of any node on the next lower level. T
1-2
Let C be an alphabet in which each character c in C has frequency c.freq. If the size of C is n, the length of the optimal prefix code for any character c is not greater than n−1. T
1-5
哈夫曼树的结点个数不能是偶数 T
2-1
When generating Huffman codes for n distinct characters, if the corresponding Huffman tree has 115 nodes in total, then the value of n must be: C
A.56
B.57
C.58
D.60
n等于结点数除以2加一