Red-Black Trees
An enhanced self-balancing binary search tree.
What is a Red-Black Tree?
A Red-Black Tree is a binary search tree where each node is either red or black.
Properties
- Every node is red or black
- Root node is always black
- Red nodes cannot have red children
- Every path from root node to null node has the same number of black nodes
Link to another web page with more information
Red-Black Trees on Wikipedia