An AVL Tree (Adelson-Velsky and Landis tree) is a self balancing binary search tree such that for every internal node of the tree the heights of the children of node can differ by at most 1. If the difference in the height of left and right sub-trees is more than 1, the tree is balanced using rotation techniques
Read this article to understand AVL Tree in depth
Following image illustrates one of the four types of rotations in AVL Tree:
This is a companion discussion topic for the original entry at https://iq.opengenus.org/avl_tree/