Those data structures can not learn from the leetcode— Red-black tree(2)
How the rebalancing happens during deletion in RB Tree
Continuing with advanced DSA topic: Skip list, B Tree Step by Step, Treap.
And in the last post, we know 8 cases to handle during insertion.
In this post, I will go over the deletion process of the Red-black tree step by step.
quick recap. what defines the Red-black tree.