Advanced
Data Structures & Algorithms
Q85 / 100
What is van Emde Boas tree and its advantage?
Correct! Well done.
Incorrect.
The correct answer is B) A tree for integers in [0, U) supporting insert, delete, successor, predecessor in O(log log U) time
B
Correct Answer
A tree for integers in [0, U) supporting insert, delete, successor, predecessor in O(log log U) time
Explanation
Van Emde Boas tree achieves O(log log U) operations by recursively splitting the universe into sqrt(U) clusters, dramatically faster than O(log n) for integer keys with bounded universe U.
Progress
85/100