AVL-Trees

This is an example of an AVL binary Tree, this tree includes rotations to guarantee O(n logn) time complexity in the worst case.