Is there some fast and @nogc capable binary search tree for D?

[solidstate1991 via Digitalmars-d]

Some components of my game engine would benefit from lookup 
trees. I tried to port one from Go, but either I messed up 
something bit that certain parts of the codes just won't execute 
for some reason, or the algorithm was poorly documented, and it 
will only optimize on one end of the binary search tree.

Looked around on dub, couldn't find anything that wouldn't 
introduce too much new dependencies or that was actually @nogc 
capable. I would be interested in some preexisting one, or some 
better documented ones from the web. All I can find is either 
very basic theory or things that already work well in my 
implementation, like indexing and insertion without optimization.