A red-“black tree is a self-balancing binary search tree with an extra bit of data per node, its color, which can be either red or black