data structures using (hb - (hb (ht (hc ( - ( - - ( - ( - (ab (ha ( (bt (ht ( - (cheight (new nodefigure lr rotation in an avl tree example consider the avl tree given in fig tree (ais an avl tree in tree ( ) new node is inserted in the right sub-tree of the left and insert into it sub-tree of the critical node (node is the solution critical node because it is the closest ancestor (step (step whose balance factor is not - or )so we apply lr 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 figure avl tree nowconsider the avl tree given in fig and see how rl rotation is done to rebalance the tree - - (ht ( - ( - (hc (hb ( - (at ( - ( (new nodefigure rl rotation in an avl tree - (hc (hb (ht ( - (cheight (