单链表删除头节点和不知道N的情况下寻找中间节点

void RemoveHead( node *head )
{
node *p;
p = head->next;
head->next = p->next;
free(p);
}


void SearchMid( node *head, node *mid )
{
node *temp = head;
while( head->next->next != NULL )
{
head = head->next->next;
temp = temp->next;
mid = temp;
}

}