Data Structures :: Trees
3. The worst case time complexity of AVL tree is better in comparison to binary search tree for
Search is O(log N) since AVL trees are always balanced. Insertion and deletions are also O(logn) where as in case of BST it is O(n).