AVL tree is a self-balancing binary search tree in which each node maintains extra information called a balance factor whose value is either -1, 0 or +1. AVL tree got its name after its inventor Georgy Adelson-Velsky and Landis.
In rotation operation, the positions of the nodes of a subtree are interchanged. There are two types of rotations: *Left Rotate *Right Rotate