链表的插入、删除

结构体：

typedef struct Student{
    int m_val;
    struct Student* m_next;
}NODE,*pNODE;

链表的插入：

//尾部插入
void linkInitTail(pNODE* pphead)
{
    int val;
    pNODE pNew,pTail;
    while(scanf("%d",&val) == 1)
    {
        pNew = (pNODE)calloc(1,sizeof(NODE));
        pNew->m_val = val;
        if(*pphead == NULL)
        {
            *pphead = pNew;
            pTail = pNew;
        }
        else
        {
            pTail->m_next = pNew;
            pTail = pNew;
        }
    }
    pTail = NULL;
}

//头部插入,不需记录尾部结点
void linkInitHead(pNODE* pphead)
{
    pNODE pNew;
    int val;
    while(scanf("%d",&val) == 1)
    {
        pNew = (pNODE)calloc(1,sizeof(NODE));
        pNew->m_val = val;
        pNew->m_next = *pphead;
        *pphead = pNew;
    }
}
//有序插入
void linkInitOrder(pNODE* pphead)
{
    pNODE pNew,pPrevious,pCurrent;
    int val;
    while(scanf("%d",&val) == 1)
    {
        pNew = (pNODE)calloc(1,sizeof(NODE));
        pNew->m_val = val;

        pCurrent = *pphead;
        pPrevious = NULL;

        while(pCurrent && pCurrent->m_val < pNew->m_val)
        {
            pPrevious = pCurrent;
            pCurrent = pCurrent->m_next;
        }
        if(pPrevious == NULL)
        {
            pNew->m_next = *pphead;
            *pphead = pNew;
        }
        else
        {
            pNew->m_next = pCurrent;
            pPrevious->m_next = pNew;
        }
    }
}

链表的删除：

void linkDelete(pNODE* pphead, int value)
{
    pNODE pPrevious = NULL, pCurrent = *pphead;
    while(pCurrent && pCurrent->m_val != value)
    {
        pPrevious = pCurrent;
        pCurrent = pCurrent->m_next;
    }
    if(pCurrent == NULL)
        printf("Not exist!");
    else
    {
        if(pPrevious == NULL)//删去头结点
        {
            *pphead = pCurrent->m_next;
            free(pCurrent);
        }
        else
        {
            pPrevious->m_next = pCurrent->m_next;
            free(pCurrent);
        }
    }

}