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.

Red-Black tree definition

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
LORY

A Senior Software Developer/Body builder . to help others enjoy coding and stay healthy