AVL trees belong to unique type of binary search trees.In AVL trees,difference of height of left subtree and right subtree of every node is nearly one.They are called as self-balancing binary search trees.
(1)AVL tree is a self-balancing binary search tree.
(2)In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property.
(3)The technique of balancing the height of binary trees was developed by Adelson, Velskii, and Landi and hence given the short form as AVL tree or Balanced Binary Tree.
(4)AVL tree is efficient when your job have more searching than insertion.
(5)Thus,AVL tree is a binary search tree in which the difference of heights of left and right subtrees of any node is less than or equal to one.
AVL trees are beneficial in the cases where you are designing some database where insertions and deletions are not that frequent but you have to frequently look-up for the items present in there.
AVL trees are applied in th e following situations:
There are few insertion and deletion operations
Short search time is needed
Input data is sorted or nearly sorted
.NET Developer at iFour Technolab Pvt LTd
You showed up just in time for the waffles! And this tiny ad:
Devious Experiments for a Truly Passive Greenhouse!