tjmers/optimized-red-black-binary-search-tree

This is a header-only C++ red-black binary search tree library. A caller instantiates the templated tree and uses its operations for ordered storage and lookup; the README also documents configurable node, comparator, equality, and allocator types, memory reservation and shrinking, copying and moving, and in-order iteration. The implementation is concentrated in one header, so its behaviors are represented as a single runtime component rather than an artificial multi-module pipeline.