AVL stands for Adelson-Velskii and Landis. An AVL tree is a binary search tree which has the following properties:
1.The sub-trees of every node differ in height by at most one.
2.Every sub-tree is an AVL tree. Search time is O(logn). Addition and deletion operations also take O(logn) time.
