Red Black Tree

Introduction

A Red-Black Tree is a self-balancing binary search tree used in computer science to maintain sorted data efficiently. It ensures logarithmic time complexity for insertions, deletions, and lookups.

Properties of Red-Black Trees

1. Every node is either Red or Black.
2. The root node can (and will) always be set to black.
3. Red nodes cannot have a red node as a child.
4. The number of black nodes is the same along every path from a fixed node (can be any) to every descendant null reference.

Insertion Of RBT

Different situation

• Red Sibling

• Black Sibling & Line

• Black Sibling & Zig

• Null Siilbling

For more information: