Why AVL tree ?In binary search tree, in worst case height of binary search tree goes to n and searching of element takes O(n) time.that's by AVL comes and height of AVL is log(n).