Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Last updated: Aug 2, 2022

AVL Tree

An AVL tree is a self-balancing binary search tree. It is named after its inventors Adelson-Velsky and Landis who were the first to propose the concept of dynamically balanced trees. In an AVL tree, the heights of the left and right subtrees of any node differ by at most one. Rebalancing is done whenever the height-balanced property is violated. Since it is height-balanced, the time complexities of all the operations are search, insertion or deletion is O(log n) in both the average and worst cases.  
AVL Tree Data Structure EASY
This article discusses the introduction to AVL trees, their advantages, representation, properties and various operations performed on them.
Insertion in AVL Trees
This article discusses AVL trees as special cases of balanced binary search trees where insertion and deletion operations take place in O(log n) time.
Deletion in AVL Tree MEDIUM
Deleting a node from an AVL tree follows similar principles to a binary search tree. However, it may disrupt the balance factor, requiring the tree to be rebalanced to maintain its AVL property.
How to Insert Strings into an AVL Tree EASY
This blog briefly discusses the concepts of AVL trees and explores in detail how to insert a string in an AVL tree.
Insertion, Searching, and Deletion in AVL trees containing a parent node pointer
This article discusses the method to do operations like insertion, searching and deletion in an AVL tree containing a parent node pointer.
Convert Sorted Array to Balanced BST
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.
Find the closest greater value for every element in the array
This blog discussed finding the closest greater value for every element in the array. Read the blog to learn these methods in detail
AVL Tree using graphics in C++
In this article, we will learn how to implement AVL trees using graphics in C++.
AVL With Duplicate Keys
We will solve a question on a topic related to AVL duplicate key.
Count Inversions in An Array MEDIUM
In this article, we will solve a famous question on the array: count inversions in an array, which is asked in many interviews.