AVL tree is a selfpropelled search tree where each node stores additional information called a balance factor with a value of 1, 0, or +1.
Balance Factor
The balance factor of a node in an AVL tree is the difference between the height of the left subtree and that of that node's right subtree.
Balance Factor = (Height of Left Subtree  Height of Right Subtree) or (Height of Right Subtree  Height of Left Subtree)
The balance factor maintains the selfbalancing property of an AVL tree. The value of the balance factor should always be 1, 0, or +1.
Operations on an AVL tree
Various operations that can be performed on an AVL tree are:
Rotating the subtrees in the AVL tree
In rotation operation, the subtree mode positions are rotated.
There are two types of exchange:
