Courses
Tutorials
Interview Prep
DSA
Practice Problems
C
C++
Java
Python
JavaScript
Data Science
Machine Learning
Courses
Linux
DevOps
Similar Topics
Web Technologies
32.1K+ articles
DSA
20.4K+ articles
Misc
7.7K+ articles
Difference Between
3.1K+ articles
Tree
911+ articles
Computer Subject
828+ articles
Advanced Data Structure
306+ articles
Binary Search Tree
166+ articles
ES6
104+ articles
Self-Balancing-BST
37+ articles
Red Black Tree
12 posts
Recent Articles
Popular Articles
Red-Black Tree definition & meaning in DSA
Last Updated: 23 July 2025
A red-black tree is a self-balancing binary search tree in which each node of the tree has an color, which can either be red or black.Example of Red-Black TreeCharacterist...
read more
Tree
Picked
DSA
Definitions and Meanings
Red Black Tree
What is the difference between Heap and Red-Black Tree?
Last Updated: 23 July 2025
What is Heap?A Heap is a special Tree-based data structure in which the tree is a complete binary tree. There are two types of heap - Min heap and Max heap.To learn more a...
read more
Heap
Picked
DSA
Red Black Tree
Interval Tree using GNU Tree-based container
Last Updated: 15 July 2025
Consider a situation where we have a set of intervals and we need the following operations to be implemented efficiently: Add an intervalRemove an intervalGiven an interva...
read more
Tree
Advanced Data Structure
C++ Programs
DSA
Intellipaat
QA - Placement Quizzes-Data Interpretation
Red Black Tree
Scala-Arrays
TCS-coding-questions
ES6
Find K for every Array element such that at least K prefixes are ≥ K
Last Updated: 15 July 2025
Given an array arr[] consisting of N non-negative integers, the task is to find an integer K for every index such that at least K integers in the array till that index are...
read more
DSA
prefix
cpp-multiset
Red Black Tree
Red Black Tree vs AVL Tree
Last Updated: 13 January 2026
Table of ContentRed Black Tree: AVL(Adelson-Velskii and Landis) TreeComparison Table: Red-Black Tree vs AVL TreeApplicationRed Black Tree: A Red-Black tree is a balanced b...
read more
Binary Search Tree
Difference Between
DSA
AVL-Tree
Self-Balancing-BST
Red Black Tree
Tango Tree Data Structure
Last Updated: 01 February 2023
INTRODUCTION:'Tango Tree is a data structure for efficient dynamic connectivity and range minimum/maximum query on a set of elements. It is a type of balanced binary searc...
read more
Misc
Advanced Data Structure
DSA
Self-Balancing-BST
Red Black Tree
Left Leaning Red Black Tree (Insertion)
Last Updated: 21 July 2022
Prerequisites : Red - Black Trees.A left leaning Red Black Tree or (LLRB), is a variant of red black tree, which is a lot easier to implement than Red black tree itself an...
read more
Binary Search Tree
Advanced Data Structure
Computer Subject
DSA
Self-Balancing-BST
Red Black Tree
C Program for Red Black Tree Insertion
Last Updated: 23 July 2025
Following article is extension of article discussed here.In AVL tree insertion, we used rotation as a tool to do balancing after insertion caused imbalance. In Red-Black t...
read more
Binary Search Tree
DSA
Self-Balancing-BST
Red Black Tree
Deletion in Red-Black Tree
Last Updated: 23 July 2025
Deletion in a red-black tree is a bit more complicated than insertion. When a node is to be deleted, it can either have no children, one child or two children.Here are the...
read more
Advanced Data Structure
DSA
Self-Balancing-BST
Red Black Tree
Check if a given Binary Tree is height balanced like a Red-Black Tree
Last Updated: 23 July 2025
In a Red-Black Tree, the maximum height of a node is at most twice the minimum height (The four Red-Black tree properties make sure this is always followed). Given a Binar...
read more
Tree
Binary Search Tree
DSA
Self-Balancing-BST
Red Black Tree
Insertion in Red-Black Tree
Last Updated: 23 July 2025
In the previous post, we discussed the introduction to Red-Black Trees. In this post, insertion is discussed. In AVL tree insertion, we used rotation as a tool to do balan...
read more
Binary Search Tree
Advanced Data Structure
DSA
Self-Balancing-BST
Red Black Tree
Introduction to Red-Black Tree
Last Updated: 14 March 2026
A Red-Black Tree is a self-balancing binary search tree with a height limit of O(logN), enabling efficient search, insertion, and deletion operations in O(logN) time, unli...
read more
Advanced Data Structure
DSA
Self-Balancing-BST
Red Black Tree
Tutorials