// node structure for a binary search tree
struct node {
   int data;
   int height;
   struct node *left;
   struct node *right;
};
 
// inserts key k into an avl tree t
struct node * insertavl(struct node *t, int k);
 
// deletes key k from avl tree t
struct node * deleteavl(struct node *t, int k);