源文件:
#include "LinkList.h"
#include <assert.h>
#include <stdio.h>
// 在单链表的尾部插入一个节点
void PushBack(PNode* pHead, DataType data)
{
PNode pCurNode = NULL;
PNode pNewNode = NULL;
assert(pHead);
pNewNode = BuyNode(data);
if(pNewNode == NULL)
return;
if(*pHead == NULL)
{
*pHead = pNewNode;
}
else
{
pCurNode = *pHead;
while(pCurNode->_pNext)
{
pCurNode = pCurNode->_pNext;
}
pCurNode->_pNext = pNewNode;
}
}
// 构建一个新节点
Node* BuyNode(DataType data)
{
PNode pNewNode = (Node*)malloc(sizeof(Node));
if(pNewNode == NULL)
return NULL;
pNewNode->_data = data;
pNewNode->_pNext = NULL;
return pNewNode;
}
// 正向打印单链表
void PrintList(PNode pHead)
{
if(pHead == NULL)
return;
while(pHead)
{
printf("%d->",pHead->_data);
pH