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.
Self Balancing Binary Search Trees
By Soumya Agrawal
● Published At Mar 2022
In this article, we will be covering an exciting topic Self Balancing Binary Search Trees.... Keep reading ..
Introduction To AVL Trees
By Yukti Kumari
● Published At Oct 2021
This article discusses the introduction to AVL trees, their advantages, representation, properties and various operations performed on them.... Keep reading ..
Operations on AVL Tree
The basic operations of an AVL tree entail performing the same actions that would be performed on an unbalanced binary search tree. Still, alterations are followed by zero or more tree rotations, which are done to balance the height. We'll be exploring how to Traverse, Search and perform deletions on the AVL tree.
Insertion in AVL Trees
By Aditya Narayan Joardar
● Published At Apr 2022
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. ... Keep reading ..
How to Insert Strings into an AVL Tree
By Ishita Chawla
● Published At Dec 2021
This blog will discuss the problem of how to insert strings into an AVL tree.... Keep reading ..
Optimal Sequence for AVL Tree Insertion
● Published At Feb 2022
This article will discuss the problem “Optimal sequence for AVL Tree Insertion”, the solution approach to this problem, its C++ implementation, and its time and space complexity.... Keep reading ..
Deletion in AVL Tree
By vaishnavi pandey
● Published At Oct 2021
In this article, we’ll be learning about deleting a node from the AVL tree.... Keep reading ..
Insertion, Searching, and Deletion in AVL trees containing a parent node pointer
By Shreya Deep
● Published At Jan 2022
This article discusses the method to do operations like insertion, searching and deletion in an AVL tree containing a parent node pointer.... Keep reading ..