Search
Now showing items 1-2 of 2
The Complexity of Splay Trees and Skip Lists
(University of the Western Cape, 2008)
Our main results are that splay trees are faster for sorted insertion, where AVL trees are faster for random insertion. For searching, skip lists are faster than single class top-down splay trees, but two-class and multi-class ...
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 ...