What is a Red-Black Tree?
This lesson is an introduction to Red-Black trees, their properties, and the total time they take to perform the operations of insertion, deletion and searching. We will also make a small comparison between AVL and Red-Black Trees.
We'll cover the following...
Introduction #
Red-Black Trees are another type of self-balancing Binary Search Tree, but with some additions: the nodes in Red-Black Trees are colored either red or black. Colored nodes help with re-balancing the tree after insertions or deletions. We will go through the insertion and deletion functions of Red-Black trees just like we did with AVL Trees ...
Access this course and 1400+ top-rated courses and projects.