Inorder(Node * root)
{
 while(1)
  {
    While(p->Left)
      { 
       push(p);
       P = p->left;
      }

   if( isEmptyStack())
       Break;
   Else
     {
     t = pop()
     Print t ;
     p = t->r; 
     }32rewrewrewrew
  }
}