Address Book Project - 2
CS2500, Spring, 1997
For this project, your are to re-implement the address book using a binary search tree implementation. Each address should be a record, containing at least name and phone number. The user should have a set of options, including adding a new person, finding an entry (by name), revising an entry, listing all entries in alphabetical order, and, for extra credit, deleting an entry. For the time being, you still do not need to write the information to a file . . .
This project is due (e-mailed to me) by thursday, May 22.