Take the bst.cpp code from class and make the following changes:
  + write test cases to test all the functions and show they are working
    properly.  
  + keep track of # of operations in the functions, and optionally print how
    many operations a function took.  Count the number of recursive calls as 
    the number of operations, and make a function called printOps that will
    print the number of operations from the last function call.
  + complete the deleteKey function.
  + extra credit - make it self balancing.  3 points max.

15 points total.

Due Tuesday October 16 at midnight.