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 c

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.