What is the difference between avl tree and binary search tree in tabular form?

| Feature | AVL Tree | Binary Search Tree (BST) | |------------------------|-----------------------------------|------------------------------------| | Balance | Always balanced (height difference ≤ 1) | Not necessarily balanced | | Rotations | Requires rotations after insertions/deletions | No rotations needed | | Search Time Complexity | O(log n) due to balance | O(n) in the worst case (unbalanced) | | Use Case | Suitable for frequent insertions/deletions | Simpler structure, easier to implement for static datasets |