Implementation of the data-structure - AVLTree. Written in Python as an assignment given in 'Data Structures' course in University.
An AVLTree is a self-balancing binary tree, in which the heights of the two child subtrees of any node differ by at most one. Such tree uses 'rotations' along the path of insertions & deletions to maintain its defining invariant. Its balanced properties allows it to acheive logarithmic asymptotic time-complexity bounds. Full analysis and proofs of asymptotic bounds were lectured in the course and can be found online.