1)  What's the time complexity of the following member functions in
    the Tree ADT in both balanced and unbalanced "modes"? 
    a) find
    b) insert

    How do these times differ from the  run time efficiency of the 
    SortedList and unsorted list ADTs?

2)  In Proj2 you were asked to think of alternatives to the SortedList
    implementation for Concordance.  Now you have one.
    What are the advantages and disadvantages of your implementations
    compared to the one used in the previous project?

3)  You could easily adapt your ConcordanceEntry to be a RedBlackTree of 
    line numbers as well.  Did you?  Would you?  Are there any assumptions
    you can make about the inputs to the entry's list of line numbers that 
    could help improve the performance of your insertion routine?

4)  Make a table comparing the run times of your program on the following
    input files:
	this file (341-Fall00-p2-questions.txt)
	fox_frag.txt
	fox.txt
	wasteland.txt
	hamlet.txt

    Clock time, measured in seconds, is acceptable for this assignment -- we'll
    use better measures of execution time later.  For each file, run the unix 
    command 'wc' to get an estimate of the length to put in your table.

    Include your measurements from Proj2 in the same table (if you don't
    have a working Proj2, use the sample from Proj2).  Has this new 
    implementation improved the overall performance?  Why or why not?