Contents:

• Overview
• Collaboration Policy
• Problems to be Submitted
• Extra Credit

Topic: Trees
Related Reading: Ch. 7 and skim Ch. 12.4. Most relevant for these questions will be 7.2.2, 7.2.3, and 7.3.6.
Due: Friday, 18 April 2012, 10:00am

Collaboration Policy

For this assignment, you must work individually.

Please make sure you adhere to the policies on academic integrity in this regard.

1. (5 points)

   For the tree in Figure 7.11 (on page 285), what order will nodes be visited during a postorder traversal?

2. (5 points)

   Draw a (proper) binary tree T such that simultaneously,

   • each node of T stores a single character
   • a preorder traversal of T yields BIGZANYCOMPUTER
   • an inorder traversal of T yields GIAZNBCYPMTUEOR
3. (10 points)

   The following binary string represents an encoded message using the format described in the upcoming decode programming assignment (for the sake of typesetting, we are breaking up the display to have 24 bits per line, but you should assume they are contiguous).

   000100111010010011011100
   100110011110011011110000
   100110010010011011001001
   100001010011010011000100
   000001001100011100010111
   000110000000010011001010
   100111010101001110010100
   111001111000110010101111
   101001000111101000110010
   001010011001111111110110
   110101110100010111100011
   100001010001010110111100
         

   Decode this message by hand and submit a picture of the Huffman tree as well as the decoded message.