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…

--

--

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