notes sub-tree)balanced (both sub-trees are the same heightor right-heavy (the height of the right sub-tree is greater than the left sub-treeif the balance would be destroyed by an insertiona rotation is performed to correct the balance let us consider the following avl tree in which node has been inserted in the left subtree of node this insertion causes its height to become greater than node- ' right sub-tree right-rotation is performed to correct the imbalanceas shown below avl rotationa tree rotation can be an intimidating concept at first you end up in situation where you're juggling nodesand these nodes have trees attached to themand it can all become confusing very fast find it helps to block out what' going on with any of the subtrees which are attached to the nodes you're fumbling withbut that can be hard left rotation (llimagine we have this situationa lovely professional university