EECS 215 Homework 1 Due Thursday Week 2

• Always write the time-complexity (in Big Oh notation) in a comment next to every method or function you write in this class.
• (80 points) Write class AVLBinarySearchTree as presented in the text book.
• (20 points) Write a driver program that allows the user to test your class implementation. Again use the PCTimer class to measure the following times
• Note there is a good start on this program and some support code in the 215/src directory. Feel free to use it, but it is written off the top of my head and will probably not compile without some appropriate includes, namespace using, and other changes.
  • the total time needed to insert all words from the test input file.
  • the total time needed to find every word from 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. Both these files can be found in 215/src directory.
• What to submit:
  • Email me your source codee and an execution script that shows your program works as described above.