Description

Skip list is a datastructure that probabalistically determines relationships between nodes. This results in a structure that performs similarly to a BST but is much easier to build from a programmatic perspective (no rotations).

SkipList is referenced in 1 repository

github.com/Workiva/go-datastructures