Exploring the Duality Between Skip Lists and Binary Search Trees (2007)
| Citations: | 2 - 0 self |
BibTeX
@MISC{Dean07exploringthe,
author = {Brian C. Dean and et al.},
title = { Exploring the Duality Between Skip Lists and Binary Search Trees},
year = {2007}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Although skip lists were introduced as an alternative to balanced binary search trees (BSTs), we show that the skip list can be interpreted as a type of randomly-balanced BST whose simplicity and elegance is arguably on par with that of today’s most popular BST balancing mechanisms. In this paper, we provide a clear, concise description and analysis of the “BST ” interpretation of the skip list, and compare it to similar randomized BST balancing mechanisms. In addition, we show that any rotation-based BST balancing mechanism can be implemented in a simple fashion using a skip list.
