C++ Implementation of Thread Safe Red-Black Trees that uses no STL, no external dependency at all.

The implementation is generic and highly efficient. insertion of 1 million nodes of int32_t keys takes 521ms and retrieval from 1 Million nodes tree takes 2ms!!

to Compile, checkout from the svn and make.

Note You must have gtest installed to run the test suite.