What is a Red-Black Tree?
This lesson is an introduction to Red-Black trees, their properties, and the total time it takes to perform the operations of insertion, deletion, and searching.
We'll cover the following...
Introduction
A Red-Black Tree is another type of self-balancing Binary Search Tree, just like the AVL Trees , but with some additions. The nodes in a Red-Black Tree are colored to either red or black. Colored nodes help in re-balancing the tree after insertion or deletion. There are also some cases used to balance the Red-Black Trees. We will also go through the insertion and deletion operations of the Red-Black Tree.
Properties of Red-Black Trees
-
Every node has either ...