You are given a pointer to the root of an AVL tree. You need to insert a value into this tree and perform the necessary rotations to ensure that it remains balanced.

/* Node is defined as : typedef struct node { int val; struct node* left; struct node* right; int ht; } node; */

node * insert(node * root,int val) { }