PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
June 1, 1990Communications of the ACM1,171 citationsOpen Access

Skip lists: a probabilistic alternative to balanced trees

WPWilliam Pugh

Key Points

  • The aim is to evaluate the efficiency of skip lists compared to balanced trees in data structure operations.
  • Analyzed the algorithms for insertion and deletion in skip lists versus balanced trees.
  • Discussed the probabilistic balancing mechanism of skip lists.
  • Compared the computational complexity of each algorithm.
  • Skip lists provide significantly faster insertion and deletion compared to balanced trees.
  • The algorithms for skip lists are simpler to implement than those for balanced trees.

Abstract

Skip lists are data structures that use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

William Pugh (1990) studied this question.

synapsesocial.com/papers/6a02821c67f6ea5cc87543fdhttps://doi.org/10.1145/78973.78977
Ask AI
Helpful
Bookmark
Share
View Full Paper