Project Description
A well documented, simple and straight-forward implementation of a red-black-binary search tree generic collection.
This template class is fully compatible with the C++ standard template library (STL) algorithms.

This project is meant for students and c++ programmers who want to learn about red-black trees.
Also, this class demonstrates how simple is to write a STL-compatible collection.

In order to fully understand this implementation, you shuold be familiar with the STL, emphasizing the concept of iterators.

Last edited Jul 14, 2008 at 9:52 PM by idisis, version 2