In this Project,you can find a Phone book is implemented in an AVL Tree, you add new contacts, delete, and save the list to a text file
Please check the project files here:
https://sourceforge.net/projects/phonebookavl/files/
A simple Ternary Search tree implementation, which also includes delete and getting common prefixes operation. I've tested it on Linux WindRiver 1.4 box with g++. Please report bugs at kunalekawde2002@yahoo.com