backslash-zero / 42-redBlackTrees

Implementation of a Red-Black Binary Tree in C++

Red Black binary trees

Background:

C++ Implementation of self-balancing binary search tree with Red Black technique. This was done as part of the ft_containers project for 42 School.

Each node stores an extra bit representing "color" ("red" or "black"), used to ensure that the tree remains balanced during insertions and deletions.

Debugging use dot files:

The redBlackTree_debug.hpp helps generating a .dot file that allows us to generate these handy graphs for debugging.

---

Ressources:

• This excellent YouTube playlist about Red Blac Trees and insertions.
• This Geeks for Geeks article for deletions.
• My implementation within ft_containers project at 42.
• https://graphviz.org/ for DOT language help.