Those data structures can not learn from leet code— Red-black tree(1)

Compared to Treap, it is more “stable” (grantee balanced)

Continuing with advanced DSA topic: Skip list, B Tree Step by Step, Treap.

In this post, I will go over the process of building a Red-black tree (inserting process) step by step.

First, What defines a red-black tree?

Red-Black tree definition

1. It is a self-balanced BST. (Binary Search Tree)
2. Every node has a color…