This project implements an augmented AVL tree (a self-balancing binary search tree) in Python, designed specifically for storing and querying intervals efficiently. The tree allows you to insert ...

This program utilizes Python Curses to show live each phase of the AVL Tree after each insertion and rotation. This program can do both single and double rotations, as it's a requirement really, for ...