Move comments around, add test example. First off, this commit moves in-depth discussion of implementation details and efficiency from the BTree docstring to the package docstring. Secondly, we add a simple test example detailing most of the functionality of the tree.
This package provides an in-memory B-Tree implementation for Go, useful as a an ordered, mutable data structure.
The API is based off of the wonderful http://godoc.org/github.com/petar/GoLLRB/llrb, and is meant to allow btree to act as a drop-in replacement for gollrb trees.
See http://godoc.org/github.com/google/btree for documentation.