Under a Huffman encoding of n symbols with frequencies f1, f2,..., fn, what is the longest a codeword could possibly be? Give an example set of frequencies that would produce this case.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.