Coding problem: Consider an AVL tree where structure node consists of struct node \{ int key, data, size, height; node left, *right, parent; Write a code for void r rotate ( node x ) - without using transplant. Please ensure that correct values of height and size are restored after rotation..