Red Black Tree
Introduction
Red Black Tree is one of the self-balanced Binary Search Trees.
Property
- Each node is either red or black
- The root node is black
- Red nodes cannot have red children
- Leaf node are all black null nodes
- All paths from the root to a black null leaf have the same number of black nodes
Related Website
wikipedia