This project was an assigment in my Data Structures and Algorithms course. It uses Lazily-Balanced Binary Sort Trees as well as other data structures to create a Student/Faculty database system

The options that the user is given (until exit) are the following:

1. Print all students and their information (sorted by ascending id #)
2. Print all faculty and their information (sorted by ascending id #)
3. Find and display student information given the student id
4. Find and display faculty information given the faculty id
5. Add a new student
6. Delete a student given the id
7. Add a new faculty member
8. Delete a faculty member given the id.
9. Change a student’s advisor given the student id and the new faculty id.
10. Remove an advisee from a faculty member given the ids
11. Exit

More information can be found on the project's README, linked above