Introduction

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 -

Properties

A002_Hardik Ahuja

I am a highly organized and hard-working individual. I have just started writing blogs and hope it goes well!

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store