Red-Black Trees

Properties

• Every node is either red or black
• Guaranteed O(log n) time complexity for core operations
• Balance maintained through color constraints
• Requires rotation and recoloring during modifications

Learn more at Wikipedia