This Go package provides a balanced binary search tree data structure, expected to have logarithmic height.
This is for go version 1.0.
For more on treaps, check out the following links:
This implementation borrows a lot of ideas from GoLLRB by Petar Maymounkov.
This package was extracted from production code powering StatHat, so clearly we feel that it is production-ready, but it should still be considered experimental as other uses of it could reveal issues we aren't experiencing.