This package provides an immutable treap implementation in the Go Language. A treap is a data structure that maintains a dynamic set of ordered keys and allows binary searches among the keys. Its height is, with high probability, proportional to the logarithm of the number of keys, so that each search, insertion, or deletion operation takes logarithmic time to perform. gtreap's implementation of a treap is immutable, and thus provides a simple approach to multi-version concurrency control. It's an alternative fork of https://github.com/steveyen/gtreap.