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