Algorithms and Data Structures · Senior · Question 13 of 75

What is a skip list?

Explanation

Each node gets a random height; higher levels skip more nodes. Search, insert and delete are O(log n) on average, and the structure is simpler to make concurrent than a balanced tree. Redis sorted sets use skip lists.

Further reading

Problem with a question

Algorithms and Data Structures · Senior · question 13

Test yourself

Take the Algorithms and Data Structures · Senior quiz: questions and options are shuffled, and you get a review of your mistakes at the end.

Take this quiz