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

by
Question:

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

Answer» d. search, insert and delete operations

Note: The above multiple-choice question is for all general and Competitive Exams in India.