COP 3530 Project: Basic Level AVL Tree Structure This tree stores student names and IDs as singular nodes, with no duplicates
- Self-balancing when adding or removing nodes
- Catch Test program with various test methods to individually assess the various elements of the tree
- Prints nodes in Inorder, Preorder, Postorder
- Search feature to find student via:
- Name
- ID
- REGEX utilized to reduce the time complexity of name/ID comparisons