带头结点的单链表

带头单链表的定义

typedef int SHDataType;
typedef struct SHListNode
{
	SHDataType data;
	struct SHListNode *next;
}SHNode, *pSHNode, SHList, *pSHList;

创建一个新结点

pSHNode SHBuyNode(SHDataType d)
{
	pSHNode pnode = (pSHNode)malloc(sizeof(SHNode));
	if (NULL == pnode)
	{
		assert(0);
	}
	pnode->data = d;
	pnode->next = NULL;
	return pnode;
}

初始化

void SHListLinkInit(pSHList* ppshlist)
{
	assert(ppshlist);
	pSHNode pnode = SHBuyNode('#');
	*ppshlist = pnode;
}

尾部插入

void SHListLinkPushBack(pSHList pshlist, SHDataType d)
{
	assert(pshlist);
	pSHNode pnode = SHBuyNode(d);
	pSHList cur = pshlist;
	while (NULL != cur->next)
	{
		cur = cur->next;
	}
	cur->next = pnode;
}

尾部删除

void SHListLinkPopBack(pSHList pshlist)
{
	assert(pshlist);
	pSHList cur = pshlist;
	if (NULL == cur->next)
	{
		return;
	}
	while (NULL != cur->next->next)
	{
		cur = cur->next;
	}
	pSHList del = cur->next;
	cur->next = NULL;
	free(del);
	del = NULL;
}

头部插入

void SHListLinkPushFront(pSHList pshlist, SHDataType d)
{
	assert(pshlist);
	pSHNode pnode = SHBuyNode(d);
	pSHList cur = pshlist;
	pnode->next = cur->next;
	cur->next = pnode;
}

头部删除

void SHListLinkPopFront(pSHList pshlist)
{
	assert(pshlist);
	pSHList cur = pshlist;
	if (NULL == cur->next)
	{
		return;
	}
	pSHList del = cur->next;
	cur->next = cur->next->next;
	free(del);
	del = NULL;
}

销毁

void SHListLinkDelete(pSHList* ppshlist)
{
	assert(ppshlist && *ppshlist);
	while (NULL != *ppshlist)
	{
		pSHList del = *ppshlist;
		(*ppshlist) = (*ppshlist)->next;
		free(del);
		del = NULL;
	}
}