views:

31

answers:

1

I'm not quite sure how to determine what the longest possible codeword is under Huffman encoding for a specific set of frequencies?

Any ideas?

+2  A: 

For a specific set of frequencies? Generate your tree, then see how tall it is... If you're talking about in general, then it's something like N - 1.

Sam Dufel