ECE 198 Homework 4 Due Early Week 5, On-Time Week 6 Last modified: 4/19/2002

• Always write the time-complexity (in Big Oh notation) in a comment next to every method or function you write in this class.
• Use the test input and timers from homework 1.
• (60 points) Write class BinarySearchTree as presented in lecture.
• (40 points) Write a driver program that allows the user to test your class implementation. Again use the PCTimer class to measure the following times
  • the total time needed to insert all words from the test input file.
  • the total time needed to find all every word from the test input file.
  • the total time needed to remove all words given in the test input file.
  • Again, be sure your main program takes arguments from the command line for input file name and output file name.
  • Test your program on random.txt and on words.txt and note the difference in speed.
• What to submit:
  • Show your TA that your program works as described above.
  • Submit (and save) your program for future comparison with the others.