April 2018
Beginner to intermediate
426 pages
10h 19m
English
Like the AVL tree, the Red-Black tree is also a self-balancing binary search tree. We learned that inserting or removing a node from the AVL tree might cause rotations, so if we need a self-balancing tree that involves many frequent insertions or deletions, then the Red-Black tree is preferred. If the insertions and deletions are less frequent (we are interest in frequent search operations), then the AVL tree is preferred over the Red-Black tree.
In the Red-Black tree, every node follows the rules which are listed as follows: