数据结构学习笔记-7

//快速找到未知长度单链表的中间结点
Status FindMidNode(LinkList L, ElemType *e)
{

    LinkList search, mid;
    mid = search = L;

    while(search->next != NULL)
    {
        if(search->next->next != NULL)
        {
            search = search->next->next;

            mid = mid->next;
        }
        else
        {
            search = search->next;    
        }
    }

    *e = mid->data;

    return OK;             
}