BinarySearchTree address book java

Write a program that maintains the names, addresses, and phone numbers of your friends and relatives and thus serves as an address book. You should be able to enter, delete, modify, or search this data. The person’s name should be the search key, and initially you can assume that names are unique. The program should be able to save the address book in a file for use later. When tested, I will start with an empty address book. Design a class to represent people in the address book and another class to represent the address book itself. The class should contain a binary search tree of people as a data member. You should use the Binary Search Tree described in the chapter for the underlying implementations of your trees. Your interface may be simple alphanumeric exchanges through standard input and output. due 1/26/13