Contents:

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

1. (5 points)
   For the tree in Figure 6.3, 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 ANSWER; and
   • an inorder traversal of T yields NSAEWR

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.

4. (2 points)
   Creativity Exercise C-6.11 of the text.