myrto-iglezou / red-black-tree Goto Github PK
View Code? Open in Web Editor NEWA red–black tree is a self-balancing binary search tree. Each node of the binary tree has an extra bit, and that bit is interpreted as the color (red or black) of the node. These color bits are used to ensure the tree remains balanced during insertions and deletions.