AVL tree is a binary search tree in which the difference of heights of left and right subtrees of any node is less than or equal to one. The technique of balancing the height of binary trees was developed by Adelson, Velskii, and Landi, as a result it was named after the abbreviation of the three names as AVL tree. An AVL tree is said to be balanced when both left and right subtrees are balanced.
