Similar Topics

DSA

21.1k+ articles

Mathematical

7.6k+ articles

Arrays

6.4k+ articles

Tree

1.3k+ articles

C++ Programs

1.1k+ articles

Data Structures

800+ articles

Advanced Data Structure

460+ articles

Binary Search Tree

240+ articles

Self-Balancing-BST

40+ articles

Balanced Binary Search Trees

10+ articles

AVL-Tree

20+ posts

Popular articles

Recent articles

What is AVL Tree | AVL Tree meaning

Last Updated: 15 March 2023

An AVL is a self-balancing Binary Search Tree (BST) where the difference between the heights of left and right subtrees of any node cannot be more than one. KEY POINTSIt i...read more

Definitions and Meanings

Difference between Binary Search Tree and AVL Tree

Last Updated: 08 January 2023

Binary Search Tree:A binary search tree is also called an ordered or sorted binary tree because the in-order traversal of binary search tree is always in sorted order.A bi ...read more

Binary Search Tree

AVL Tree Data Structure

Last Updated: 02 November 2023

An AVL tree defined as a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees for any node cannot be more than one.The d...read more

Technical Scripter

Technical Scripter 2022

Similar Topics

DSA

21.1k+ articles

Mathematical

7.6k+ articles

Arrays

6.4k+ articles

Tree

1.3k+ articles

C++ Programs

1.1k+ articles

Data Structures

800+ articles

Advanced Data Structure

460+ articles

Binary Search Tree

240+ articles

Self-Balancing-BST

40+ articles

Balanced Binary Search Trees

10+ articles

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

Last Updated: 05 December 2023

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

Self-Balancing-BST

Data Structures

Balanced Binary Search Trees

Optimal sequence for AVL tree insertion (without any rotations)

Last Updated: 06 September 2022

Given an array of integers, the task is to find the sequence in which these integers should be added to an AVL tree such that no rotations are required to balance the tree ...read more

Binary Search Tree

Advanced Data Structure

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

Self-Balancing Binary Search Trees

Last Updated: 28 March 2023

Self-Balancing Binary Search Trees are height-balanced binary search trees that automatically keep the height as small as possible when insertion and deletion operations a...read more

Binary Search Tree

Advanced Data Structure

Red Black Tree vs AVL Tree

Last Updated: 10 November 2022

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

Binary Search Tree

Self-Balancing-BST

Difference Between

Count greater nodes in AVL tree

Last Updated: 20 April 2023

In this article we will see that how to calculate number of elements which are greater than given value in AVL tree. Examples:Input : x = 5 Root of below AVL tree ...read more

Binary Search Tree

Advanced Data Structure

How to sort a big array with many repetitions?

Last Updated: 24 January 2023

Consider a big array where elements are from a small set and in any range, i.e. there are many repetitions. How to efficiently sort the array?Example: Input: arr[] = {100 ...read more

Self-Balancing-BST

AVL with duplicate keys

Last Updated: 14 February 2023

Please refer below post before reading about AVL tree handling of duplicates.How to handle duplicates in Binary Search Tree?This is to augment AVL tree node to store count ...read more

Advantages of BST over Hash Table

Last Updated: 26 April 2023

Hash Table supports following operations in ?(1) time. 1) Search 2) Insert 3) Delete The time complexity of above operations in a self-balancing Binary Search Tree (BST) ( ...read more

Binary Search Tree

Self-Balancing-BST

Deletion in an AVL Tree

Last Updated: 18 January 2023

We have discussed AVL insertion in the previous post. In this post, we will follow a similar approach for deletion.Steps to follow for deletion.To make sure that the given...read more

Advanced Data Structure

Self-Balancing-BST

Insertion in an AVL Tree

Last Updated: 03 October 2023

AVL Tree: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.Exampl...read more

Binary Search Tree

Advanced Data Structure

Self-Balancing-BST

Count smaller elements on Right side

Last Updated: 03 May 2023

Given an unsorted array arr[] of distinct integers, construct another array countSmaller[] such that countSmaller[i] contains the count of smaller elements on the right si ...read more

Self-Balancing-BST