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

Q.	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

587

Do you find this helpful?

View all MCQs in

Discussion

No comments yet