Tutorials
Courses
Go Premium

Similar Topics

Web Technologies32.1K+ articles

DSA20.0K+ articles

Misc7.8K+ articles

Arrays4.2K+ articles

Tree909+ articles

Advanced Data Structure305+ articles

cpp-set202+ articles

Binary Search Tree166+ articles

AVL-Tree23+ articles

Red Black Tree12+ articles

Self-Balancing-BST

37 posts

B Tree in Python

Last Updated: 23 July 2025

A B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time.B Tree in...read more

article_image

Advanced Data Structure

Self-Balancing-BST

How to insert Strings into an AVL Tree

Last Updated: 23 July 2025

AVL Tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes.Examples:The ab...read more

article_image

Binary Search Tree

Self-Balancing-BST

Implementation of AVL Tree using graphics in C++

Last Updated: 23 July 2025

AVL Trees are self-balancing Binary Search Trees where the difference between heights of left and right subtrees cannot be more than one for all nodes. Below is the exampl...read more

article_image

Self-Balancing-BST

computer-graphics

Insertion, Searching and Deletion in AVL trees containing a parent node pointer

Last Updated: 23 July 2025

AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes. The insertion ...read more

article_image

Self-Balancing-BST

Balanced Binary Search Trees

Print all integers that are sum of powers of two given numbers

Last Updated: 11 July 2025

Given three non-negative integers x, y and bound, the task is to print all the powerful integer ? bound in sorted order.A powerful integer is of the form xi + yj for all i...read more

Self-Balancing-BST

Minimum number of nodes in an AVL Tree with given height

Last Updated: 10 April 2023

Given the height of an AVL tree 'h', the task is to find the minimum number of nodes the tree can have.Examples :Input : H = 0Output : N = 1Only '1' node is possible if th...read more

Binary Search Tree

Self-Balancing-BST

Longest subarray with only one value greater than k

Last Updated: 11 July 2025

Given an array of N numbers, find length of the longest subarray such that K is the second largest element on insertion.Examples:Input: a[] = {9, 5, 5, 6, 8}, K = 7Output:...read more

Self-Balancing-BST

cpp-unordered_set

Queries to add, remove and return the difference of maximum and minimum.

Last Updated: 11 July 2025

Given Q queries. The queries are of three types and are described below:Add the number num to the list.Remove the number num from the list.Return the difference between th...read more

Self-Balancing-BST

Red Black Tree vs AVL Tree

Last Updated: 11 July 2025

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 or Black).When the...read more

article_image

Binary Search Tree

Difference Between

Self-Balancing-BST

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

article_image

Advanced Data Structure

Self-Balancing-BST

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

article_image

Binary Search Tree

Advanced Data Structure

Computer Subject

Self-Balancing-BST

Minimum Possible value of |ai + aj - k| for given array and k.

Last Updated: 19 September 2023

You are given an array of n integer and an integer K. Find the number of total unordered pairs {i, j} such that absolute value of (ai + aj - K), i.e., |ai + aj - k| is min...read more

Binary Search Tree

Self-Balancing-BST

Find N'th item in a set formed by sum of two arrays

Last Updated: 23 July 2025

Given two sorted arrays, we can get a set of sums(add one element from the first and one from second). Find the N'th element in the elements of the formed set considered i...read more

Self-Balancing-BST

Maximum subarray sum modulo m

Last Updated: 23 July 2025

Given an array of n elements and an integer m. The task is to find the maximum value of the sum of its subarray modulo m i.e find the sum of each subarray mod m and print ...read more

Self-Balancing-BST

Modular Arithmetic

ScapeGoat Tree | Set 1 (Introduction and Insertion)

Last Updated: 23 July 2025

A ScapeGoat tree is a self-balancing Binary Search Tree like AVL Tree, Red-Black Tree, Splay Tree, ..etc.Search time is O(Log n) in worst case. Time taken by deletion and ...read more

article_image

Advanced Data Structure

Self-Balancing-BST