Very fast Go Skiplist implementation.

Skiplist implementation in Go.

Generic key-sorted map using a red-black tree under the hood.

Persistent, fast ordered map using tree heaps.

Space-efficient computation of Merkle root hashes and inclusion proofs.