AVL Tree

#include<bits/stdc++.h>
using namespace std;

struct Node 
{
       struct Node *lchild;
       int data;
       int height ;// we need to store the height 0f each node
       struct Node *rchild;
}*root=NULL;


int NodeHeight(struct Node *p)
{   int hl,hr;
    hl= p&&p->lchild?p->lchild->height:0;
    hr= p&&p->rchild?p->rchild->height:0;
    return max(hl+1,hr+1);
}


int BalanceFactor(struct Node *p)
{   int hl,hr;
    hl= p&&p->lchild?p->lchild->height:0;
    hr= p&&p->rchild?p->rchild->height:0;
    return max(hl-hr);
}

struct Node * LLRotation(struct Node *p)
{
    struct Node *p1=p->lchild;
    struct Node *plr=pl->rchild;
    pl->rchild=p;
    p->lchild=plr;
    p>height=NodeHeight(p);
    pl->height=NodeHeight(pl);
    
    if(root==p)
    root=pl;
    
    
    return pl;
}


struct Node * RRRotation(struct Node *p)
{
    struct Node *p1=p->rchild; 
    struct Node  *plr=pl->lchild;
    pl->lchild=p;
    p->rchild=plr;
    p>height=NodeHeight(p);
    pl->height=NodeHeight(pl);
    
    if(root==p)
    root=pl;
    
    
    return pl;
}




struct Node * LRRotation(struct Node *p)
{
 struct Node *pl=p->lchild;
 struct Node *plr=pl->rchild;

 pl->rchild=plr->lchild;
 p->lchild=plr->rchild;

 plr->lchild=pl;
 plr->rchild=p;

 pl->height=NodeHeight(pl);
 p->height=NodeHeight(p);
 plr->height=NodeHeight(plr);

 if(root==p)
 root=plr;
 return plr;
}
struct Node *Insert(struct Node *p,int key)
{
    struct Node *t;
  if(p==NULL)
  {
      t=(struct Node *)malloc(sizeof(struct Node));
      t->data=key;
      t->height=1;
      t->lchild=t->rchild=NULL;
      return t;
  }
  
      if(p->data>key)
      {
          p->lchild=Insert(p->lchild,key);
      }
      else if(p->data<key)
      p->rchild=Insert(p->rchild,key);
      p->height=NodeHeigth(p);
      if(BalanceFactor(p)==2&&BalanceFactor(p->lchild)==1)  //LLROTATION
      return LLRotation(p);
      else if(BalanceFactor(p)==2&&BalanceFactor(p->lchild)==-1)
      return LRRotation(p);
      else if(BalanceFactor(p)==-2&&BalanceFactor(p->lchild)==-1)
      return RRRotation(p);
      else if(BalanceFactor(p)==-2&&BalanceFactor(p->lchild)==1)
      return RLRotaion(p);
      return p;
 
    
}