The Huffman code is one kind of optimal prefix codes. For a give

The Huffman code is one kind of optimal prefix codes. For a given alphabet and its characters' frequencies，the Huffman codes may not be unique, but the Huffman code **length** of each character is unique. ~@[](2)

答案：FALSE