Using the file /home/www/class/een511/database.txt, which contains a
large number of fanancial records for ficticious people in this format

100058800 06 10 1925 Jason Ipswitch 87.10
100127084 26 05 1964 Benjamin Grant 31.20
100324711 07 07 1983 Urkel Gordon 817.46
100552655 18 11 1982 Roxanne Underwood 315.23
100725147 24 08 1960 Frank Porlock 3.77
100784281 12 02 1929 Alvin Rathbone 892.79

(that is social security number, date of birth, first name, last name, 
and bank balance)

Write a program that reads the data from this file and stores it in
an AVL tree organised to make seraches based on full name as fast as
possible.

Once the data has been read and the tree has been built, your program
should start accepting commands from the user. It should accept:

find A B
         where A is a first name and B is a last name. It should print
         all the details of the person named A B, if they exist.

verify
       Check the balance of every node, verifying that they are all
       +1, 0, or -1. Then print the overall height of the tree.

exit
     exit.