A skiplist provides a way of storing data with
log(i) access, insertion and removal for an element in the
There are three kinds of collections defined here:
- SkipList This behaves like nearly any other double-ended list.
- OrderedSkipList Ensures that the elements are always sorted. Still allows for access nodes at a given index.
- SkipMap A map in which the keys are ordered.