[an error occurred while processing this directive]
Homework Assignment
05
Trees
Contents:
Overview
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:
Thursday, 10 October 2002
Please make sure you adhere to the policies on
academic honesty.
Practice Problems
Problems to be Submitted (20 points)
- (5 points)
For the tree in Figure 6.3, what order will nodes be visited
during a postorder traversal?
- (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
- (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.
- (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.
Extra Credit
- (2 points)
Creativity Exercise C-6.11 of the text.
CS A 220, Fall 2003
Michael Goldwasser
goldwamh nbsp; @ slu.edu
Last modified: 4 October 2002
[an error occurred while processing this directive]