Red-Black Trees:The Problem With Insertion
Insert 11
- Where does it go?
- What color?
- Can’t be red! (#3)
- Can’t be black! (#4)
1. Every node is either red or black
2. Every leaf (NULL pointer) is black
3. If a node is red, both children are black
4. Every path from node to descendent leaf contains the same number of black nodes
5. The root is always black