Perform the normal BST rotation
if ( Node == null ) return ( new Node ( key ) ) ; if ( key < Node . key ) Node . left = insert ( Node . left , key , count ) ; else { Node . right = insert ( Node . right , key , count ) ;