链表的删除操作，删除头节点就会出问题 大家看看问题出在哪里呢

Question

struct Link *DeleteNode(struct Link *head,int nodeData)//链表的删除
{
struct Link *p = head,*pr = head;
if (head == NULL)//首先需要判断链表是否为空！若空！无需执行删除操作！
{
printf("No Linked Table!\n");
return(head);
}
while(nodeData != p->data && p->next != NULL)//若没找到nodeData且未到表尾，则继续找！
{
pr = p;
p = p->next;
}
if (nodeData == p->data)
{
if(p == head)//判断是否删除首节点
{
head = p->next;//
}
else
{
pr->next = p->next;
}
free(p);
}
else
{
printf("this Node has not been found!");
}
return head;
}

int main()
{
int i = 0;
int place = 0;
int nodeData;
char c;
struct Link *head = NULL;//指向链表头
printf("Do you want to append a new node(Y/N)");
scanf(" %c",&c);
while(c=='Y' || c=='y')
{
head = AppendNode(head);
DispLink(head);//显示当前各节点信息
printf("Do you want to append a new node(Y/N)");
scanf(" %c",&c);
i++;
}
printf("%d new nodes have been appended!\n",i);
printf("please input the nodeData you want to delete:");
scanf("%d",&nodeData);
DeleteNode(head,nodeData);
DispLink(head);
printf("please input the nodeData you want to insert:");
scanf("%d",&nodeData);
printf("输入插入的位置");
scanf("%d",&place);
InsertNode01(head,nodeData,place);
DispLink(head);
//InsertNode(head,nodeData);

//DeleteMemory(head);//释放分配内存
return 0;

}

Answer 1

代码都没有，怎么知道。不过根据以往问问题人一般的问题，估计是你先释放了内存后删除的节点，会导致出错。
你的程序貌似出现了死循环，看下是不是出现了链表循环引用的问题。