c++

Develop a simple database system. The database will handle multiple records, each composed of several fields. The database will store its information to a file, addition and deletion of records, field modification, and it will allow user to sort records based on the selected keys, and produce reports (output) according to predefined criteria.

Given the requirements as a rough specification, you're supposed to design the class and implement the database. So you can consider the requirements below as an outcome from a meeting with a client. You are in full control of the choice of data structures (except the main data structure of AVL tree), algorithms, internal file format, and detailed user interface scheme.

There will a file with a list of contact informations. Each contact information includes followings:

Unique ID number. ID is a 9 digit number

First name

Middle name (or initial)

Last name

Company name

Home phone

Office phone

Email

Mobile number

Street address

City

State

Zip code

Country

The AVL Tree will contain, not characters/letters, but entire records, sorted by ID. There are no requirements to print IDs. You may find yourself using a function similar to the print() function. Instead of printing, you will use something like the print function to traverse (go to) every node in the tree. Once at each node, you can then search every field for the strings or sub-strings that you are looking for. If you find it, you will either want to print it out, or put it in another data structure (like a vector) for future printing or sorting.