Height of a Red-Black tree is proportional to the number of nodes.

Color of red node's children can be either red or black.

Use rotations and recoloring to maintain balance.

Worst-case time complexity of O(log n) for search, insertion, and deletion

It's a type of self-balancing binary search tree.

Every leaf node is at the same depth.