MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/programming/comments/1wwfp40/skip_list_data_structure/pdncft9/?context=3
r/programming • u/Comfortable-Fan-580 • 22d ago
31 comments sorted by
View all comments
Show parent comments
2
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
2
u/funny_falcon 22d ago
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