Gerth Stølting Brodal
University of Aarhus
12.2Dynamic Finger Search Trees
12.4Randomized Finger Search Trees
Optimal Merging and Set Operations•Arbitrary Merging Order•List Splitting•Adaptive Merging and Sorting
One of the most studied problems in computer science is the problem of maintaining a sorted sequence of elements to facilitate efficient searches. The prominent solution to the problem is to organize the sorted sequence as a balanced search tree, enabling insertions, deletions and searches in logarithmic time. Many different search trees have been developed and studied intensively ...
Get Handbook of Data Structures and Applications, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
