Question 1
Suppose that we have a text file that contains 8 o, 14 b, 10 i, 5 w, 4 a, 3 n, 10 blanks and 2 newlines.
Which of the "character and Huffman encoding" pair can not be obtained from the Huffman tree?
Your answer:
? o - 011
? i - 111
? w - 010
? a - 1000
? n - 11011
Clear answer
Submit