int delnode(Node **rootp, int del_value)
{
    Node *previous;
    Node *current = *rootp;
    previous = NULL;
    while(current != NULL && current->value != del_value)
    {
        previous = current;
        current = current->link;
    }

    if(current == NULL)
        return FALSE;
    if(previous == NULL)
        *rootp = current->link;
    else
        previous->link = current->link;
   
   
    free(current);   //当我添加这一句时 就会显示出错   是什么原因呢
   
    return TRUE;
}