Just names (format: fname lname) and birthdays (format: yyyy-mm-dd) as data attributes are sufficient.

Implement your BST as a link-based ADT - use Node

For the data, create a text file of data in a random fashion - name or birthday entry per line.

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 (separate from your input) using a post-order traversal mechanism.

Write out the listing of everyone by birthday to a different file using a breadth-first traversal mechanism.

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. 5. 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