A red-black tree is a kind of self balancing binary search tree in which each node contains an extra bit for denoting the color of the node, either red or black. This tree was invented in 1972 by Rudolf Bayer who termed them “symmetric binary B-trees”. As the name suggests, they are called red-black trees because each node in the tree is labeled as red or black.
Below is a representation of a Red-Black Tree -
I am a highly organized and hard-working individual. I have just started writing blogs and hope it goes well!