tree (ais an avl tree in tree ( ) new node is inserted in the left sub-tree of 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 )so we apply rl rotation as shown in tree (cnote that the new node has now become part of tree while rotationnode becomes the rootwith and as its left and right children node has and as its left and right sub-trees and and become the left and right sub-trees of node example construct an avl tree by inserting the following elements in the given order solution (step (step (step - after lr rotation (step (step (step - - - - - (step - (step - - - after ll rotation (step - - - (step figure avl tree deleting node from an avl tree deletion of node in an avl tree is similar to that of binary search trees but it goes one step ahead deletion may disturb the avlness of the treeso to rebalance the avl treewe need to perform rotations there are two classes of rotations that can be performed on an avl tree after deleting given node these rotations are rotation and rotation on deletion of node from the avl treeif node becomes the critical node (closest ancestor node on the path from to the root node that does not have its balance factor as or - )then the type of rotation depends on whether is in the left sub-tree of or in its right sub-tree if the