C++ program that will build BST in MSVC2017

Programming Problem 5 on page 491 of the book (screenshot below) :

• Just names (format: fname lname) and birthdays (format: yyyy-mm-dd) as data attributes are sufficient.
• Implement your BST as a link-based ADT by deriving BST Node from your Node classes from Labs 2 and 2b. Remember the BST Node will contain two data attributes – name and birthday.
• For the data, create a text file of data named ‘InputData.txt’ as follows – name or birthday entry per line, one pair of name and birthday in two consecutive lines.
• Read the data to create your BST for the database by name or birthday as needed – remember two different trees will be needed and the node insertions will be different depending on which data tree it is.
• Write out the listing of everyone by name to a file called ‘NamesOutput.txt’ using both pre-order and post-order traversal mechanisms in that sequence. Ensure that the output file contains names and birthdays on a single line separated by tabs. Make sure that each section is clearly identified by a header.
• Write out the listing of everyone by birthday to a different file called ‘BirthdaysOutput.txt’ using an in-order and breadth-first traversal mechanisms in that sequence. Ensure that the output file contains names and birthdays on a single line separated by tabs. Make sure that each section is clearly identified by a header.
• Include your code source tree, input text file and the two output files in your zip upload. Only one file upload is allowed.
• Ensure I can run the programs by using my own input file without having to fix your code for file locations.

Any other questions or clarifications – ask on the forum first.

5. Write a program that maintains a database containing data, such as name and birthday, about your friends and
relatives. You should be able to enter, remove, modify, or search this data. Initially, you can assume that the
names are unique. The program should be able to save the data in a file for use later.
Design a class to represent the database and another class to represent the people. Use a binary search tree
of people as a data member of the database class.
You can enhance this problem by adding an operation that lists everyone who satisfies a given criterion.
For example, you could list people born in a given month. You should also be able to list everyone in the
database.