Search
Now showing items 1-1 of 1
The Complexity of Splay Trees and Skip Lists
(University of the Western Cape, 2008)
Binary search trees (BSTs) are important data structures which are widely used
in various guises. Splay trees are a specific kind of binary search tree, one without
explicit balancing. Skip lists use more space than BSTs ...