链表链式结构的写法

struct ListNode
{
int data;
ListNode* next;
};
void AddToTail(ListNode** pHead,int v){
ListNode* pNew = new ListNode();
pNew->data = v;
pNew->next = NULL;
if(*pHead == NULL)
*pHead = pNew;
else{
ListNode* pNode = *pHead;
while(pNode->next!=NULL)
pNode = pNode->next;
pNode->next = pNew;
}
}
void RemoveNode(ListNode** pHead,int v)
{
if(pHead == NULL || *pHead == NULL)
return;
ListNode* pToBeDeleted = NULL;
if((*pHead)->data == v){
pToBeDeleted = *pHead;
*pHead = (*pHead)->next;
}else{
ListNode* pNode = *pHead;
while(pNode->next !=NULL && pNode->next->data !=v)
pNode = pNode->next;
if(pNode->next!=NULL && pNode->next->data ==v){
pToBeDeleted = pNode->next;
pNode->next = pNode->next->next;
}
}
if(pToBeDeleted!=NULL){
delete pToBeDeleted;
pToBeDeleted = NULL;
}
}