typedef struct _Node {
int data;
struct _Node * next;
} NODE;
NODE* insert_after_node(NODE* Head,const int K)
{
NODE* p = Head;
NODE* q = (NODE* )malloc(NODE);
if(NULL == Head)
return NULL;
while(p->data != K && p->next != NULL)
{
p=p->next;
if(p->data == K)
{
q->next=p->next;
p->next=q;
}
}
return Head;
}