|Que.||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.||search, insert and delete operations|
|D.||insert and delete operations|
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.