在链表结尾插入一个结点 以及在 在链表中找到第一个含有某值的结点并删除该结点

#include "stdafx.h"
#include <iostream>
#include <exception>
using namespace std;

struct ListNode
{
    int m_nValue;
    ListNode* m_pnext;
};

void InsertNodeTail(ListNode** L,int num)
{
    ListNode* node = new ListNode();
    node->m_nValue = num;
    node->m_pnext = NULL;
    if(*L == NULL)
    {
        *L = node;
    }
    else
    {
        ListNode *pHead=*L;
        while(pHead->m_pnext!=NULL)
            pHead=pHead->m_pnext;
        pHead->m_pnext = node;
    }
}

void RemoveNode(ListNode** pHead,int value)
{
    if(pHead ==NULL||*pHead ==NULL)
        return;
    ListNode* pToBeDeleted = NULL;
    if((*pHead)->m_nValue == value)
    {
        pToBeDeleted = *pHead;
        *pHead = (*pHead)->m_pnext;
    }
    else
    {
        ListNode* pNode = *pHead;
        while(pNode->m_pnext != NULL && pNode->m_pnext->m_nValue!=value)
            pNode = pNode ->m_pnext;
        if(pNode->m_pnext != NULL && pNode ->m_pnext->m_nValue ==value)
        {
            pToBeDeleted = pNode->m_pnext;
            pNode->m_pnext = pNode->m_pnext->m_pnext;
        }
    }
    if(pToBeDeleted!=NULL){
        delete pToBeDeleted;
        pToBeDeleted = NULL;
    }

}
int _tmain(int argc, _TCHAR* argv[])
{ 

    return 0 ;
}