AVL tree

An unbalanced binary search tree has the worst case search time of O(n). Therefore, balancing the tree will make search time more efficient. AVL Tree, named after its inventors Adelson-Velsky and Landis, is a special variation of Binary Search Tree w...