数据结构（链表）

概念：链表是一种物理存储结构上非连续，非顺序的存储结构，数据元素的逻辑顺序是通过链表中的指针链接次序实现的

#include <stdio.h>
#include <stdlib.h>
#include<assert.h>
typedef int SqDataType;
typedef struct SqLinkNode
{
	SqDataType data;
	struct SqLinkNode* next;
}SLNode;
//尾部插入结点
void SLinkPushBack(SLNode** pphead, SqDataType x);
//头部插入结点
void SLinkPushFront(SLNode** pphead, SqDataType x);
//尾部删除结点
void SLinkPopBack(SLNode** pphead);
//头部删除结点
void SLinkPopFront(SLNode** pphead);
//查找某结点
SLNode* SLinkFind(SLNode* phead, SqDataType x);
//指定位置插入某结点
void SLinkInsert(SLNode** pphead, SLNode* pos, SqDataType x);
//指定位置删除结点
void SLinkErase(SLNode** pphead, SLNode* pos);
//打印单链表
void SLinkPrint(const SLNode** pphead);

#include"SqLinkList.h"
void SLinkPrint(const SLNode** pphead)
{
	const SLNode* cur = *pphead;
	if (*pphead == NULL)
		printf("NULL");
	while (cur)
	{
		printf("%d ", cur->data);
		cur = cur->next;
	}
}

void SLinkPushBack(SLNode** pphead,SqDataType x)
{
	SLNode* newnode = (SLNode*)malloc(sizeof(SLNode));
	assert(newnode);
	newnode->data = x;
	newnode->next = NULL;
	if (*pphead == NULL)
	{
		*pphead = newnode;
	}
	else
	{
		SLNode* cur = *pphead;
		while (cur->next!=NULL)
		{
			cur=cur->next;
		}
		cur->next = newnode;
	}
}
void SLinkPushFront(SLNode** pphead, SqDataType x)
{
	SLNode* newnode = (SLNode*)malloc(sizeof(SLNode));
	assert(newnode);
	newnode->data = x;
	newnode->next = NULL;
	newnode->next = *pphead;
	*pphead = newnode;
}
void SLinkPopBack(SLNode** pphead)
{
	assert(*pphead);
	SLNode* prev = NULL;
	SLNode* tail = *pphead;
	if ((*pphead)->next == NULL)//一个结点的时候
	{
		free(*pphead);
		*pphead = NULL;
	}
	else
	{
		while (tail->next != NULL)//两个及以上的结点
		{
			prev = tail;
			tail = tail->next;
		}
		free(tail);
		prev->next = NULL;
	}
}
void SLinkPopFront(SLNode** pphead)
{
	assert(*pphead);
	SLNode* next = (*pphead)->next;
	free(*pphead);
	*pphead = next;
}
SLNode* SLinkFind(SLNode* phead, SqDataType x)
{
	SLNode* cur = phead;
	while (cur)
	{
		if (cur->data == x)
		{
			return cur;
		}
		cur = cur->next;
	}
	return NULL;
}
void SLinkInsert(SLNode** pphead, SLNode* pos, SqDataType x)
{
	SLNode* newnode = (SLNode*)malloc(sizeof(SLNode));
	assert(newnode);
	newnode->data = x;
	newnode->next = NULL;
	SLNode* prev = *pphead;
	if (pos == *pphead)
	{
		SLinkPushFront(pphead, x);
	}
	else
	{
		while (prev->next != pos)
		{
			prev = prev->next;
		}
		prev->next = newnode;
		newnode->next = pos;
	}
}
void SLinkErase(SLNode** pphead, SLNode* pos)
{
	SLNode* prev = *pphead;
	if (pos == *pphead)
	{
		SLNode* cur = *pphead;
		*pphead = (*pphead)->next;
		free(cur);
		cur = NULL;
	}
	else
	{
		while (prev->next != pos)
		{
			prev = prev->next;
		}
		prev->next = pos->next;
		free(pos);
		pos = NULL;
	}
}