NOT TO BE USED OR RECREATED FOR PRUPOSE OF ACADEMIC SUBMISSIONS
- Designed for Data Structures and Algorithms course for the purpose of a course project.
- Implements self-balancing binary search tree with several search options used to efficiently store student IDs along with other possible information.
- Access in O(log(n)) time when searching by ID
- Storage is O(n)