void del_min(LinkList& L)
{
LNode* p = L->next, * pre = L;
LNode* min = p, * premin = pre;
if (L->next == NULL)
return;
pre = p; p = p->next;
while (p)
{
if (p->data < min->data)
{
premin = pre;
min = p;
pre = p;
p = p->next;
}
else
{
pre = p; p = p->next;
}
}
premin->next = min->next;
free(min);
}