Those data structures can not learn from leet code— Red-black tree(1)
Compared to Treap, it is more “stable” (grantee balanced)
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
- It is a self-balanced BST. (Binary Search Tree)
- Every node has a color…