Red Black Trees

What are Red Black Trees?

Red Black Trees are a special type of binary search tree that color nodes upon insertion of nodes in order to structure the tree efficiently.

• They are optimized for quick searches and retrievals of information.
• The black height of the tree must be the same down all paths starting from the root.
• Nodes are colored when initially inserted, but insertions of new nodes and rotations can cause recoloration.

If you would like a more in-depth understanding of Red Black Trees, check out this Geeks For Geeks article!