An AVL tree is a self-balancing binary search tree where the heights of the two child subtrees of any node differ by at most one. When this property is violated after an insertion or deletion, the ...

This program implements various classes and functions to facilitate the tree's functions.