Red-black tree rule 1:

Every node is either red or black.

Red-black tree rule 2:

If a node is one color, its child is the opposite color.

Red-black tree rule 3:

Every path from a given node to leaf nodes contains the same number of black nodes.

https://youtu.be/5IBxA-bZZH8?si=CJ8c1pDFZQ3Nl79P&t=115 https://slideplayer.com/slide/13760328/85/images/14/Insertion+Possibilities.jpg