K-ary Huffman Tree is Optimal

From: Yao Ziyuan (coolspeech_at_hotmail.com)
Date: 02/19/05


Date: Sat, 19 Feb 2005 14:49:17 +0800

Some friend's homework question.

We know the construction of a k-ary Huffman tree for Huffman encoding.
The problem is how to prove the k-ary Huffman tree is optimal?

He expects a quick response...

TIA.