Red-Black Tree
A red-black tree colors nodes and rotates so the longest path is at most twice the shortest. That bound keeps every update logarithmic.
Costs
| Category | Data Structure |
| Difficulty | Hard |
| Search | O(log n) |
| Insert | O(log n) |
| Delete | O(log n) |
Questions
What is Red-Black Tree?
A red-black tree colors nodes and rotates so the longest path is at most twice the shortest. That bound keeps every update logarithmic.
Where do I practice it?
DSA Master keeps challenges and progress on the phone. This page is the idea and the costs.