An AVL tree is a self-balancing binary search tree in computer science. It is named after its inventors, Georgy Adelson-Velsky and Evgenii Landis, who published it in their 1962 paper "An algorithm for the organization of information". In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. The difference between the heights of the left subtree and the right subtree for any node is known as the balance factor of the node. AVL trees are often compared with red-black trees because both support the same set of operations and take time for the basic operations. For lookup-intensive applications, AVL trees are faster than red-black trees because they are more strictly balanced. Some advantages of AVL trees include that they can self-balance themselves, they are not skewed, and they provide faster lookups than Red-Black Trees. However, AVL trees are difficult to implement and have high constant factors for some of the operations.