Reading time: 15 minutes | Coding time: 9 minutes
A red–black tree is a kind of self-balancing binary search tree in computer science. Each node of the binary tree has an extra bit, and that bit is often interpreted as the color (red or black) of the node. These color bits are used to ensure the tree remains approximately balanced during insertions and deletions.
This is a companion discussion topic for the original entry at http://iq.opengenus.org/red-black-tree-deletion/