Given a Huffman tree for $$N$$ ($$\ge 2$$) characters, all with

Given a Huffman tree for $$N$$ ($$\ge 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. ~@[](2)

答案：TRUE