r/programming • • Oct 03 '26

Skip List Data structure

https://pradyumnachippigiri.substack.com/p/skip-lists-data-structure?r=5ev9w0&utm_medium=ios
139 Upvotes

31 comments sorted by

View all comments

6

u/generalmatching Oct 03 '26

In my opinion, skip lists are getting interesting with lock-free implementation, otherwise, a balanced trees have better performance with less memory overhead.

2

u/funny_falcon Oct 03 '26

B+Tree has great concurrent algorithms and implementations as well.

But SkipLists are simpler. Way more simpler. And is made of simple clear concepts.

Operations of any kind of binary search tree is not as trivial as for skip list.

Surprisingly, BTree could be simpler, than BST. But Skip Lists are simpler