单选题：For a finite set $$S$$ of $$n$$ ($$n>2$$) characters, binary tre

For a finite set $$S$$ of $$n$$ ($$n>2$$) characters, binary trees $$T1$$ and $$T2$$ are used to represent the Huffman code and the code of equal length, respectively. Which of the following statements is TRUE?




A.The number of nodes in $$T1$$ is the same as that in $$T2$$.
B.The height of $$T1$$ is greater than that of $$T2$$.
C.The characters with different occurrence frequencies must appear at the different levels in $$T1$$.
D.The characters with different occurrence frequencies must appear at the same level in $$T2$$.


答案：D