Build a binary search tree that holds first names.

Build a binary search tree that holds first names..

Build a binary search tree that holds first names.  Create a menu with the following options.

  1. Add a name to the list (will add a new node)
  2. Delete a name from the list (will delete a node)                     NEXT PAGE à
  3. Search for a name (will return if the name is in the tree or not)
  4. Output the number of leaves in your tree

Build a binary search tree that holds first names.

Posted in Uncategorized