News for hackers. Stuff that matters.
Re:Advanced Data Structures by sobani on Tuesday November 08, 2016 @07:16AM (#12899617)
A skiplist is a good candidate for problems where you are considering some kind of self-balancing tree. I find a skiplist to be the simpler structure in those cases.

I personally used it in an observable collection library, where I needed efficient indexed insert and the ability to compute the index of a node.

There are no comments on this comment yet.