This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Hint: review pages 410411 for an example of how to format your answer. 3. Problem 10.3 on page 475. Draw the resulting Huffman coding tree. When combining 2 trees into 1, use the subtree with lower weight as the left node. 4. Problem 10.5 on page 477. The proof begins on page 418. Complete the proof by induction. 5. Problem 10.10 on page 477....
View
Full
Document
This note was uploaded on 07/25/2008 for the course CSE 331 taught by Professor M.mccullen during the Spring '08 term at Michigan State University.
 Spring '08
 M.McCullen
 Algorithms, Data Structures

Click to edit the document details