Skip to content

Tag Archives: Red Black Tree

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… Read More
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… Read More
Consider a situation where we have a set of intervals and we need the following operations to be implemented efficiently:  Add an interval Remove an… Read More
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… Read More
In this post, we will compare Red-Black Tree and AVL Tree.  Red Black Tree:  Properties: Self-Balancing is provided by painting each node with two colors(Red… Read More
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… Read More
Prerequisites : Red – Black Trees.A left leaning Red Black Tree or (LLRB), is a variant of red black tree, which is a lot easier… Read More
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… Read More
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,… Read More
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… Read More
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… Read More
Introduction: When it comes to searching and sorting data, one of the most fundamental data structures is the binary search tree. However, the performance of… Read More