Answers are grounded in this paper and cite their sources.
A skip list is a data structure that can be used as an alternative to balanced trees. This data structure uses probabilistic balancing rather than strictly enforcing balancing and causes simplicity in the algorithms for insertion and deletion for a skip list. This paper analyzes literature that compares the use of skip lists with other data structures. This project focused not only on the comparison of data structures, but the structure of skip list algorithms and their performance against similar types used in implementation by other data structures. The findings were that skip lists are a much easier and efficient algorithm to implement compared to self-adjusting tree and balanced search tree algorithms.
No takes yet. Share an insight, caveat, or question.
A 2016 study studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: