单选题：A Huffman tree with 61 nodes is the optimal coding tree for n ch

A Huffman tree with 61 nodes is the optimal coding tree for $$n$$ characters. What a conclusion can we make for $$n$$?






A.29
B.30
C.31
D.Cannot be determined


答案：C