The file /home/318/database2025.txt contains 10,000 lines of data. Each line describes
one person:

    Last name,
    First name,
    State where they live,
    Zip code,
    Birth date year,
    Birth date month,
    Birth date day,
    Secret password,
    Bank balance,
    Social security number.

None of those eight fields ever contain a space, and they are separated by spaces.

Here are six unexciting lines from the middle of the file:

Frankenstein Gustav GA 59728 1963 09 15 IWBMRD 50077.61 238032343
Mosley Lola MO 03617 1957 04 06 PNPDPB 10004.93 238173240     
Worst Ruth AL 56983 1951 03 06 OBHQSP 13508.46 238216226    
Stuart Christopher WY 25932 1935 08 02 EUGIIX 10377.87 238225299
Nematode Emma AZ 41919 1945 06 13 TWNKBD 40462.32 238255684   
Rapstone Dorothy IL 83197 1963 01 01 FXTMNN 45917.38 238378507

You are to write a program that reads this file or any other file with the same
layout, and stores its information in a Binary Tree. The tree should be ordered 
on the person's name - primarily last name, but when two people have the same 
last name, order them by first name. There are no people who share both their
first and last names.

Make your program accept the name of the database file from the command line
instead of always using /home/318/database2024.txt, so you might run your program
by typing
          a.out /home/318/database2025.txt

This is an assignment where efficiency does matter. Always make use of the tree's
ordering if it is possible to do so. Never search for the same thing twice in a
single operation, etc.

Once your program has constructed the tree, it should enter an interactive loop,
taking commands from the user:

FIND firstname lastname
   - display all information about the named person,
     your program must not crash if no such person exists!

FAMILY lastname
   - display all information about everyone who has that particular last name.

FIRST firstname
   - display all information about everyone who has that particular first name.

PRINT
   - display all information about everyone in the database.

OLDEST
   - print the name and zipcode of the oldest person in the database.

SAVE filename
   - save the entire database in the named file. Make sure the format is correct,
     you should be able to run your program again, this time giving it the new
     file name, and it being able to read it correctly. Also remember efficiency:
     if your program re-reads the file created here, it must build a reasonably
     well balanced tree just like the original, not one that looks more like a
     linked list.

RELOCATE firstname lastname newzipcode
   - Change to zip code of the named person. Be sure your program survives
     if no such person exists.

DELETE firstname lastname
   - Remove that person from the database, leaving the tree correctly structured.
     Test this bit sensibly.

EXIT
   - exit from the program.


Make sure your program is safe. It must never crash or produce an incorrect
result, no matter what the user does.

Make sure your program's output is neat and tidy. No unnecessary prompts.

Think carefully about how to test deletion. How can you demonstrate not just
that the deleted person can't be found any more, but also that the tree is
still in good condition. Inventing one or two new commands could help here.