The worst case time complexity of AVL tree is better in comparison to binary search tree for

• A. search and insert operations
• B. search and delete operations
• C. insert and delete operations
• D. search, insert and delete operations