Red-Black Tree Interactive Visualizer
A Red-Black Tree is a self-balancing Binary Search Tree using 1 color bit (red/black) per node to guarantee height <= 2 log2(n + 1) and O(log n) worst-case search, insertion, and deletion with O(1) rotations.
Read Red-Black Tree Complexity Guide ยท View Code Implementations