CSSE 230: Binary Search Tree Exercise - Part 4

• Continue to work on this project by yourself.
• Implement the void remove() method in both of the iterators. You need to maintain a lazy iterator. Have a look at the documentation of the remove method as found in the Java Iterator Interface. Ensure that you throw the proper exceptions:
  • A ConcurrentModificationException, if the underlying collection has been modified in any way, except for the remove() method in the iterator.
  • An IllegalStateException, if the next() method has not yet been called, or the remove() method has already been called after the last call to the next method().
• Please use the following test-suite to test your software.
• This is the final part of a multi-part exercise.
• Submit your "BinarySearchTree.java" file to the appropiate drop-box on Moodle.