node *deletion(node *phead,int n)
{
if(phead->val==n)
return phead;
node *p=phead;
while(p!=NULL)
{
if(p->next->val==n)
p->next=p->next->next;
p=p->next;
}
return phead;
}
node *deletion(node *phead,int n)
{
if(phead->val==n)
return phead;
node *p=phead;
while(p!=NULL)
{
if(p->next->val==n)
p->next=p->next->next;
p=p->next;
}
return phead;
}