data structures using node to be deleted is present in the left sub-tree of athen rotation is appliedelse if is in the right sub-treer rotation is performed furtherthere are three categories of and rotations the variations of rotation are - and rotation correspondingly for rotationthere are - and rotations in this sectionwe will discuss only rotation rotations are the mirror images of rotations rotation let be the root of the left or right sub-tree of (critical noder rotation is applied if the balance factor of is this is illustrated in fig (hb (ht ( - ( - (ht ( ( ( (ha (ht ( - (cfigure rotation in an avl tree tree (ais an avl tree in tree ( )the node is to be deleted from the right sub-tree of the critical node (node is the critical node because it is the closest ancestor whose balance factor is not - or since the balance factor of node is we apply rotation as shown in tree (cduring the process of rotationnode becomes the rootwith and as its left and right child and become the left and right sub-trees of rotation let be the root of the left or right sub-tree of (critical noder rotation is applied if the balance factor of is observe that and rotations are similar to ll rotationsthe only difference is that and rotations yield different balance factors this is illustrated in example consider the avl tree given in fig fig and delete from it tree (ais an avl tree in tree ( )the solution node is to be deleted from the right sub-tree of the critical node (node is - the critical node because it is the closest ancestor whose balance factor is not - - or since the balance factor of node - - - is we apply rotation as shown in tree ( during the process of rotationnode becomes the rootwith and as its left and (step (step right children and become the left and figure avl tree right sub-trees of