This class provides methods for creating and utilizing a Red-Black tree.
template< typename K, typename V, class KTraits = CElementTraits< K >, class VTraits = CElementTraits< V > > class CRBTree
- The key element type.
- The value element type.
- The code used to copy or move key elements. See CElementTraits Class for more details.
- The code used to copy or move value elements.
A Red-Black tree is a binary search tree that uses an extra bit of information per node to ensure that it remains "balanced," that is, the tree height doesn't grow disproportionately large and affect performance.
For a more complete discussion of the various collection classes and their features and performance characteristics, see ATL Collection Classes.