## AVL Tree

AVL tree stands for Adelson-Velsky and Landis Tree and it is a self-balancing Binary Search tree. AVL tree is the extension of Binary Search tree Data Structure. It reduces the time complexity of the many operations of Binary Search Tree. The name of this tree Data Structure AVL is named after its inventor Adelson-Velsky and Landis and they… Read More »