As part of a university data structure course, we were asked to implement an AVL tree with all the functions that accompany it. This project includes the implementaion itself using OOP, and functions like: insert, delete, split, join and more. Final grade: 100