50
Red-Black Tree
Self-balancing binary search tree with guaranteed O(log n) operations. Each node is colored red or black, with strict balancing rules ensuring the tree remains balanced.
Time Complexity
Insert:
O(log n)Space Complexity
O(n)Color Legend
Red Node
Black Node