Red-Black Tree
A red-black tree is a self-balancing binary search tree with one extra bit at each node, which is commonly read as the color (red or black). These colors are used to keep the tree balanced as insertions and deletions are made. The tree's balance isn't ideal, but it's good enough to cut down on searching time and keep it around O(log n), where n is the total number of components in the tree.
Introduction To Red-Black Trees
By Shubham Agarwal
● Published At Oct 2021
In this Blog, We will read about the Red-Black Tree, and we will compare it with the AVL tree, and we will Study how various operations work in the Red-Black tree-like searching. Then We will discuss the application of the Red-Black Tree. ... Keep reading ..
Insertion In Red-Black Trees
By Malay Gain
● Published At Oct 2021
In this article, we will learn how to insert a new node in a Red-Black Tree.... Keep reading ..
Red Black Tree Insertion
By Apoorv
● Published At Feb 2022
This article will discuss the algorithm for red black tree insertion along with the discussion on its space and time complexity. ... Keep reading ..
Red-Black Trees Top-Down Insertion
By Apoorv
● Published At Feb 2022
This article will discuss the algorithm for Red-Black Trees Top-Down Insertion along with the discussion on its space and time complexity.... Keep reading ..
Deletion in Red-Black Trees
By Malay Gain
● Published At Nov 2021
In this article, we will learn how to delete a node in a Red-Black Tree. We will discuss the algorithm for deletion in Red-Black Tree. ... Keep reading ..
Red-Black Tree (Delete)
By Jaglike Makkar
● Published At Feb 2022
In this article, we will discuss the approach to deleting a node in the Red-Black Tree.... Keep reading ..
Insertion in Left-Leaning Red-Black Tree
By GAZAL ARORA
● Published At Mar 2022
In this article, we will design an algorithm to insert in a left-leaning Red-Black Tree(LLRB). An LLRB performs the search, delete, and insert operations in O(logn) time.... Keep reading ..
Check if a given Binary Search Tree is height-balanced like a Red-Black Tree
By Shreya Deep
● Published At Jan 2022
This article discusses how to check if a given BST is height-balanced like a red-black tree.... Keep reading ..
Find the largest K for every Array element such that at least K prefixes are ≥ K.
By Jaglike Makkar
● Published At Feb 2022
In this article, we will discuss the approach to finding K for every index such that there are at least K prefixes greater than or equal to K. We will also focus on our approach’s time and space complexity.... Keep reading ..