Contents:

• Overview
• Practice Problems
• Problems to be Submitted
• Extra Credit

Topic: Trees
Related Reading: Ch. 6.1-6.4 of the text, except 6.3.5, 6.4.3 and 6.4.4. Most relevant for these questions will be 6.2.3, 6.2.4 and 6.3.4.
Due: Wednesday, 13 April 2005, 1:10pm

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

• Reinforcement Exercise R-6.2 of the text.

• Reinforcement Exercise R-6.6 of the text.

• Reinforcement Exercise R-6.12 of the text.

1. (6 points)

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

2. (7 points)

   Draw a 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. (7 points)

   Reinforcement Exercise R-6.19 (page 303)

4. (2 points)

   Creativity Exercise C-6.12 of the text.