ESE 2025Q84
Q: What is the time to perform search, insert, and delete operations in the average case as well as the worst case by using AVL tree?
(a)O(n)
(b)O(log n)
(c)O(n²)
(d)O(n log n)
Correct Answer: (d)
Detailed explanation coming soon.
Loading...