CMSC 341 Spring 2007 
Project 3 Questions

Copy this file into your directory and edit it to add your answers
to the following questions about project 3.

These questions count for 10% of your project grade.

1. (5 points)

   What is the computational complexity (in big-O terms) of your code
   for finding a tree by name?  Why? Given all of the data structures
   that we have considered to this point in the class, what is the
   best possible computational complexity that can be achieved?  How?

2. (5 points)

   Since the UNION and INTERSECTION functions are not member functions
of the BST class and are not friend functions, BST iterators must
be used to implement these functions.  What kind of BST iterator
did you use and how does your choice of iterator affect the shape
of the resulting trees?