void InsertLast(int x){ Node *t = x; t->data= x; t->next= NULL; if(first==NULL){ first= last= t; } else { last->next= t; last=t; } }
void InsertLast(int x){ Node *t = x; t->data= x; t->next= NULL; if(first==NULL){ first= last= t; } else { last->next= t; last=t; } }