What is a Red-Black Tree?
An introduction to “red-black” trees, their properties, and the total time they take to perform the operations of insertion, deletion, and searching. Learn how AVL differs from red-black trees.
We'll cover the following...
Introduction
Red-black trees are another type of self-balancing binary search tree with some additions; the nodes in red-black trees are colored either red or black. Colored nodes help with rebalancing the tree after insertions or deletions. You will go through the insertion and deletion functions of red-black trees just like you did with AVL trees previously.
Properties of Red-Black trees
-
Every node is either Red or ...