This uses the same data file as assignment 7, you can copy some of your code
from that assignment

To remind you:
On rabbit, the data file can be accessed as /home/www/class/een218/ass7f132.txt
It is social security number
      date of birth
      title
      first name
      last name
      street address
      town
      state
      zip code
for a number of people. The data is not real.

Create a struct to represent a person, read all the data from the file
into an ordered binary tree.

The tree's order should be given by the names of the people, alphabetically.
The primary key is the person's last name, but if two people have the
same last name, the secondary key is their first name.

Jonathan Abberwocky  comes before  Caroline Zaffuzazz
Michelle Cabbage     comes before  Adrian Conger-Eel
Doris Supermarket    comes before  Eric Supermarket

After building the tree, your program should accept interactive queries
from the user. A query will always consist of two strings, and there are
only two options.

1. If the user enters * *, your program should print the names of all the
   people in alphabetical order.

2. Any other input will be the name of a person (first name first, then last
   name). Search the tree for that person. If found, print all of their
   information. If not found, print "not found".