When you get a chance, could you sign the Google CLA? It's available at https://cla.developers.google.com/about/google-individual, and it needs to be signed before I accept code from you. Basically, it says "you still own the code, but you allow us to use it".

I signed it and associated it to this github account.

Thanks for signing! I'll wait for your binary search changes before merging.

Hello, sorry was traveling over the last week but I just made the change you requested. Yielded a fair gain which of course favors larger degrees.

BenchmarkIterateAscendGreaterOrEqual       10000        230029 ns/op
BenchmarkIterateAscendRange    10000        183623 ns/op

That said, I see a few other areas for improvement that would be pretty simple to do but would be larger changes. For example I saw that every single node contains a reference to BTree which is only used to freeNode and newNode. Simply moving them to package level funcs allows the reference to the tree to be removed.. which yields some more gains:

BenchmarkInsert  5000000           394 ns/op
BenchmarkDelete  3000000           409 ns/op
BenchmarkGet     5000000           355 ns/op
BenchmarkIterateAscend      3000        430221 ns/op
BenchmarkIterateAscendLessThan      5000        255032 ns/op
BenchmarkIterateAscendGreaterOrEqual       10000        231429 ns/op
BenchmarkIterateAscendRange    10000        182023 ns/op
ok      github.com/cstockton/btree-find 17.269s

With the only use of t* removed, we could take out the reference to BTree entirely- which opens us up to allowing a new pointer to be introduced into each node without incurring any net-loss.. It might be nice to have each node reference the parent node to allow a morris traversal which I believe would be much faster. Just some food for thought.

EDIT:
Should I close this out?