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: 9:30am Thursday, 2 December 2004

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

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

2. (5 points)

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

   • each node of T stores a single character
   • a preorder traversal of T yields LSONTUOI
   • an inorder traversal of T yields SOLUTION

3. (5 points)

   Let T be a general ordered tree with more than one node. Is it possible that the preorder traversal of T visits nodes in the same order as the postorder traversal of T?

   If so, give an example; if not, argue why this cannot occur.

4. (5 points)

   Let T be a general ordered tree with more than one node. Is it possible that the preorder traversal of T visits nodes in the reverse order as the postorder traversal of T?

   If so, give an example; if not, argue why this cannot occur.

5. (2 points)

   Creativity Exercise C-6.12 of the text.