Content Last Modified on January 16, 2006, at 03:03 AM CST

These are height balanced binary search trees and are named after their inventors - Adelson , Velskii and Landis. When sorted data is inserted into binary search trees they have a bad worst case which is not so in case of AVL Trees.