telephone system using binary search trees

This program is of a telephone system with an automatic redial that will allow the user to return calls automatically. It is menu driven and uses binary search trees to hold the telephone numbers of the incoming new calls and a binary search tree to hold the telephone numbers of the calls you wish to call back later. The numbers are read in from and input file to simulate incoming calls. ## Deliverables Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased. ## Platform must be done in C++ and work on Unix