Problem 1: Coda (3 points)
Use the Huffman tree shown to decode the bit-stream indicated:
10100010111010001000010011
Honor Code Acknowledgment: ___________________
Problem 1: Coda (3 points)
Use the Huffman tree shown to decode the bit-stream indicated:
10100010111010001000010011
Problem 2: Three pigs and a wolf (3 points)
The nodes shown below represent the initial forest of trees based on
frequency of character occurrences: a letter is shown with the number of
occurrences of that letter in each node. Draw a final Huffman tree
constructed from this initial forest of one-node trees.