Our website is made possible by displaying online advertisements to our visitors. Please consider supporting us by whitelisting our website.

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

/ » C Programming Basic solved MCQs / 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.