- Build a binary search tree that holds first names. Create a menu with the following options.
- Add a name to the list (will add a new node)
- Delete a name from the list (will delete a node) NEXT PAGE à
- Search for a name (will return if the name is in the tree or not)
- Output the number of leaves in your tree
Output the tree (Complete an inorder traversal.)