Red-BlackTrees

A Self-Balancing Binary Search Tree

Red-Black Trees are used in many computer science applications.

A Red-Black Tree is a self-balancing binary search tree used in various applications

Key Properties

• Every node is either red or black.
• Red nodes cannot have red children.
• Each tree must have a specific black height from the root to the leaves

Learn More

For more info vist: Geeks for Geeks - Red-Black Tree.