avl

#include<cstdio>
#include<algorithm>
using namespace std;
struct node{
 node *left;
 node *right;
 int height;
 int data;
 node(int x):data(x),left(NULL),right(NULL),height(0){}
};
struct avl
{
    node* root;
    int Height(node *NODE) {
        if(NODE==NULL) return -1;
     return NODE->height;
    }
    node* RightRotate(node *a) {
     node *b = a->left;
     a->left = b->right;
     b->right = a;
     a->height = max(Height(a->left), Height(a->right));
     b->height = max(Height(b->left), Height(b->right));
     return b;
    }
    node* LeftRotate(node *a) {
     node *b = a->right;
     a->right = b->left;
     b->left = a;
     a->height = max(Height(a->left), Height(a->right));
     b->height = max(Height(b->left), Height(b->right));
     return b;
    }
    node* LeftRightRotate(node *a) {
     a->left = LeftRotate(a->left);
     return RightRotate(a);
    }
    node* RightLeftRotate(node* a) {
     a->right = RightRotate(a->right);
     return LeftRotate(a);
    }
    node* Insert(int x, node* t) {
     if(t == NULL) {
       t = new node(x);
       return t;
     } else if(x < t->data) {
       t->left = Insert(x,t->left);
       if(Height(t->left) - Height(t->right) == 2) {
        if(x < t->left->data) {
         t = RightRotate(t);
        } else {
         t = LeftRightRotate(t);
        }
      }
     } else {
       t->right = Insert(x,t->right);
       if(Height(t->right) - Height(t->left) == 2) {
        if(x > t->right->data) {
         t = LeftRotate(t);
        } else {
         t = RightLeftRotate(t);
        }
      }
     }
     t->height = max(Height(t->left), Height(t->right)) + 1;
     return t;
    }
    /*node* Delete(int x,node *t) {
    if(t==NULL) return NULL;
    if(t->data == x) {
    if(t->right == NULL) {
    node* temp = t;
    t = t->left;
    free(temp);
    } else {
    node* head = t->right;
    while(head->left) {
    head=head->left;
    }
    t->data = head->data; //just copy data
    t->right = Delete(t->data, t->right);
    t->height = max(Height(t->left), Height(t->right)) + 1;
    }
    return t;
     else if(t->data < x) {
    Delete(x, t->right);
    if(t->right) Rotate(x, t->right);
    } else {
    Delete(x, t->left);
    if(t->left) Rotate(x, t->left);
    }
    if(t) Rotate(x, t);
    }
}*/
};
avl a;
int main()
{
    int n,x;
    scanf("%d",&n);
    a.root=NULL;
    for(int i=0;i<n;i++)
    {
        scanf("%d",&x);
        a.root=a.Insert(x,a.root);
    }
    return 0;
}