AVL tree (Georgy Adelson-Velsky and Evgenii Landis' tree, named after the inventors) is a self-balancing binary search tree. This project was meant to be a playground for learning Python. There is still a lot of work to do. Feel free to fork the project.
- Inserting a new node
- Right and Left rotations
- Inorder
- Rebalance
- Delete
- GUI