双向链表

#include<stdio.h>
#include<stdlib.h>

typedef struct Elment
{
	int id;
	char* name;
}Data;

typedef struct Node
{
	Data data;
	struct Node* prior;     //指向前驱
	struct Node* next;      //指向后继
}Node;

Node* g_phead = NULL;
int length;

void InitList()
{
	g_phead = (Node*)malloc(sizeof(Node));
	g_phead->next = NULL;
	g_phead->prior = NULL;
	//g_ptail = g_phead;
}

void InsertNode(Node* DuLinkList, int pos, Data* data) 
{
	Node* new_node = (Node*)malloc(sizeof(Node));
	new_node->data = *data;

	//如果链表为空
	if (g_phead->next == NULL)
	{
		g_phead->next = new_node;
		new_node->prior = g_phead;
		new_node->next = NULL;
	}
	else
	{
		//找到要插入位置的前置结点
		Node* pTemp = g_phead;
		for (int i = 0; i < pos-1; i++)
		{
			pTemp = pTemp->next;
		}
		//如果要插在尾部
		if (pTemp->next == NULL)
		{
			new_node->prior = pTemp;
			pTemp->next = new_node;
			new_node->next = NULL;
		}
		//如果插在中间或者第一
		else
		{
			//先连
			new_node->prior = pTemp;
			new_node->next = pTemp->next;
			//后断
			pTemp->next->prior = new_node;
			pTemp->next = new_node;
		}
	}
	length++;
}

void DeleNode(Node* DuLinkList, int pos)
{
	Node* pTemp = g_phead->next;
	Node* pFree = g_phead->next;

	if (pos > length)
	{
		printf("删除位置错误，删除失败\n");
		return;
	}

	//找到要删除的结点
	for (int i = 0; i < pos - 1; i++)
	{
		pFree = pFree->next;
	}
	//要删除结点的前驱的next直接指向要删除结点的后继
	pFree->prior->next = pFree->next;

	free(pFree);
}

void PrintList(Node* DuLikList)
{
	Node* pTemp = g_phead->next;

	while (pTemp != NULL)
	{
		printf("%d  %s-->  ", pTemp->data.id, pTemp->data.name);
		pTemp = pTemp->next;
	}

	printf("\n");
}

int main(void)
{
	Data da1;
	da1.id = 1;
	da1.name = "sdfgjhl";
	Data da2;
	da2.id = 2;
	da2.name = "thout";

	InitList();

	InsertNode(g_phead, 1, &da1);
	InsertNode(g_phead, 2, &da1);
	InsertNode(g_phead, 2, &da2);
	InsertNode(g_phead, 1, &da2);

	PrintList(g_phead);

	DeleNode(g_phead, 4);

	PrintList(g_phead);

	system("pause");
	return 0;
}