Question: Binary Search Tree
Question-1 ) Modify the BinarySearchTree class so that the iterators are fail-fast.Test your class with amain method ?
Question-2 ) Modify the BinarySearchTree class so that the BinarySearchTree objects are serializable.Test your class with a project that serializable a BinarySearchTree object, and another project that deserializes and prints that object?
Question-3 ) Create a recursive version of the add method.Make the add method a wrapper for a recursive method. Test your version with the BinarySearchTreeDriver class.