AVL Trees

Home > Computer Science > Software Engineering > Data structures > AVL Trees

A self-balancing binary search tree where the difference between heights of the left and right sub-trees cannot be more than one.