AVL Tree
The AVL Tree is a height-balanced binary search tree in which each node has a balance factor that is computed by subtracting the height of the right sub-tree from the height of the left sub-tree. If the balance factor of each node is between -1 and 1, the tree is said to be balanced; otherwise, the tree is imbalanced and must be balanced.
Convert Sorted Array to Balanced BST
By Deeksha Sharma
● Published At Jan 2022
In this blog, we will learn how to build a binary search tree from a sorted array. Since the sorted array contains elements in sorted order, it becomes pretty easy to construct Balanced BST from it. ... Keep reading ..
Different Shapes of AVL Possible at Height H
By Sujal Modanwal
● Published At Jan 2022
The task is to find the number of possible shapes of minimal AVL Trees of a given height 'H'. ... Keep reading ..
Count Inversions in an Array Using AVL Tree
By GAZAL ARORA
● Published At Mar 2022
Inversion count for an array indicates how far (or close) it is from being sorted. In this article, we will design an algorithm for counting inversions in a given array using AVL Tree.... Keep reading ..
Find the Minimum number of nodes in an AVL Tree
● Published At Dec 2021
This article discusses how to find the minimum number of nodes in an AVL Tree with a given height.... Keep reading ..
Count of Array elements greater than all elements on its left and at least K elements on its right
By Ayush Tiwari
● Published At Jan 2022
This blog finds the number of array elements greater than all elements on its left and at least K elements on its right... Keep reading ..
Number of nodes greater than K in an AVL Tree
By Gaurish Anand
● Published At Feb 2022
In this article, we will learn to find the number of nodes greater than K in an AVL Tree (self-balanced BST).... Keep reading ..
Sort the big sized array where there are many repetitions of elements
By Vaibhav Agarwal
● Published At Jan 2022
This article will discuss the problem of sorting the big array with many repetitions of elements... Keep reading ..
Counting smaller elements on the right side
By Vibhor Bhatnagar
● Published At Jan 2022
In this article, we will discuss the problem of counting smaller elements on the right side. ... Keep reading ..
Find the closest greater value for every element in the array
By Ayush Tiwari
● Published At Dec 2021
This blog discussed finding the closest greater value for every element in the array. Read the blog to learn these methods in detail... Keep reading ..