双链表创建（尾插法）

最新推荐文章于 2025-11-05 19:43:00 发布

原创最新推荐文章于 2025-11-05 19:43:00 发布 · 2.2k 阅读

1 ·

CC 4.0 BY-SA版权

C/C++ 同时被 2 个专栏收录

151 篇文章

订阅专栏

数据结构与算法

73 篇文章

订阅专栏

本文详细介绍了如何使用尾插法创建双链表，包括步骤和示例代码，帮助理解双链表数据结构的操作。






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

typedef int ItemValue;
typedef struct DoubleLinkedList
{
	ItemValue value;
	struct DoubleLinkedList *pre;
	struct DoubleLinkedList *next;
} DoubleList, *pDoubleList;

DoubleList *CreateDoubleLinkedList()
{
	DoubleList *head = (DoubleList *)malloc(sizeof(DoubleList));
	head->pre = NULL;
	head->next = NULL;
	DoubleList *pTemp;
	pTemp = head;
	ItemValue iValue;
	while (scanf("%d", &iValue) != EOF)
	{
		DoubleList *p = (DoubleList *)malloc(sizeof(DoubleList));
		p->value = iValue;
		p->next = pTemp->next;
		p->pre = pTemp;
		pTemp->next = p;
		pTemp = p;
	}
	return head;
}

void VisitDoubleLinkedList(DoubleList *L)
{
	DoubleList *p = L;
	while (p->next != NULL)
	{
		printf("%d ", p->next->value);
		p = p->next;
	}
}

int main()
{
	DoubleList *DL;
	DL = CreateDoubleLinkedList();
	VisitDoubleLinkedList(DL);

	free(DL);
	system("pause");
	return 0;
}