Operations
Animation
Speed
4x
Presets
Tree Stats
Total Nodes0
Tree Height0
Black Height0
Red Nodes0
Black Nodes0
Red
Black
NIL
Operation Log
Info
Red-Black Tree Properties:
1. Every node is Red or Black
2. Root is always Black
3. Every NIL leaf is Black
4. Red node children must be Black
5. All paths: same Black count
vs AVL Trees: RB-trees allow slightly less balance but require fewer rotations on insert/delete, making them faster for write-heavy workloads.
Used in: Java TreeMap, C++ std::map, Linux CFS scheduler, epoll.
Complexity: O(log n) guaranteed for search, insert, and delete.
1. Every node is Red or Black
2. Root is always Black
3. Every NIL leaf is Black
4. Red node children must be Black
5. All paths: same Black count
vs AVL Trees: RB-trees allow slightly less balance but require fewer rotations on insert/delete, making them faster for write-heavy workloads.
Used in: Java TreeMap, C++ std::map, Linux CFS scheduler, epoll.
Complexity: O(log n) guaranteed for search, insert, and delete.
Insert a value or load a preset to begin