This package is an implementation of red-black trees in Go using the algorithms described in Left-Leaning Red-Black Trees, R. Sedgwick 2008

The implementation is intended to be sufficiently generic that any suitable data types can be used for keys or values. Although it is not currently implemented, the intent is that eventually persistent trees will be implemented in an efficient, append-only file format, similar to a previous implementation in Common Lisp. Again, this implementation will be generic so that the algorithms for organizing data for storage can be separated from the actual underlying storage format.

See the LICENSE file for applicable licensing of this implementation.