Name: ________________________________
Honor Code Acknowledgment: _____________________________
Due: December 5
Consider the following letters and the number of occurences of each letter.
letter: r o w b a t y u occurs: 1 2 3 4 5 6 7 8
Draw the huffman tree (optimal encoded tree) for these letters.
Consider the following huffman tree.
PART A: For each letter, list its bit representation. (0 is go left, 1 is go right)
PART B: Give the unique encoding of the word: rope