BST Names

Use the binary search tree code to do the following:

• Put the names that follow into a file
• Read the file and insert the names into the binary search tree
• After all nodes have been read, print the tree using inorder.
• Print the height of the tree
• Remove Yate and Nancy
• Print the height of the tree
• Print the tree using inorder

Names:

George
Bill
Nancy
Antonio
Sally
Mike
Cathy
Zac
Nolan
Kody
Xena
Yate

Have a menu that will do:

• Add name
• remove name
• Write file
• Read file
• Show height
• Print tree inorder
• Quit

Have the user be able to drive the steps.

Have an option 7 that would write the contents of the tree to a file, inorder, then read it back in to balance the tree. Remember that the algorithm works mainly with a full tree. A full tree has the number of nodes of 2h - 1. Try and get the tree to have that number. Then write and read the tree (count the dummy nodes). Remove the dummy nodes.