新的 remove 函数

Error_code List<List_entry>::remove(int position,List.entry &x)
{
    if(count==0)
    return underflow;
    if(position<0||position>=count)
    return range_enor;
    Node<List_entry> *new_node,*previous,*followig;
    if(position>0)
    {
        previous=set_position(position-1);
        new_node=previous->next;
        following=new_node->next;
        previous->next=following;
        x=new_node;
    }
    if(position==0)
    {
        x=head;
        head=head->next;
    }
    count--;
    return success;
}