binary search trees - repost

This programming assignment requires that binary search trees be completed. As shown in the figure attached, five files are needed: two interfaces which you do not need to submit, two class files - [login to view URL] and [login to view URL] - that you should submit, and finally a driver program. Again, you do not need to submit your own driver program. Your program will be evaluated by another driver program. All the methods shown in the figure should be implemented. Please verify on your own that all methods are implemented. How? - create a driver program on your own that invokes each every single method to check its functionalities. Note that the synchronization of your trees will be important. In a driver program, a binary search tree will be saved in a ser file. Then, the ser file will be read in the driver program and used to continue to expand and/or shrink the binary search tree by add() and delete(). Before and after synchronization, three traversals will be hierarchically displayed in response to user's choice. With this, your program should ask users to choose from this top-level menu: (1) add, (2) delete, (3) sync to save, (4) load from sync, (5) display, (6) exit. If "(5) display" is chosen, three additional options should be provided in the sub-menu: (1) preOrder, (2) inOrder, (3) postOrder. After displayed propely, the program should go back to the top-level menu. Please start from the coding work given!!! Interface SearchTree is first defined. Class BinarySearch is defined. Now, BinarySearchTree is defined as a subclass of BinarySearch and it implements SearchTree. There are two Driver program: BSTDriver and BSTDriver2. An extension will be to synchronize the BST constructed in memory and the one possible stored in a storage. The interface Serializable is used. This Serializable should be implemented in BinarySearch, not anything else. In BinarySearch, there are two classes available: Outer and Inner. Both class should implement Serializable.