双向链表-C语言

代码： 

#include <stdio.h>
#include <malloc.h>

typedef struct DoubleLinkedNode 
{
	char data;
	struct DoubleLinkedNode *previous;
	struct DoubleLinkedNode *next;
}DLNode,*DLNodePtr;

//使用标头初始化列表
//return指向标头的指针

DLNodePtr initLinkList()//初始化链表
{
	DLNodePtr tempHeader = (DLNodePtr)malloc(sizeof(struct DoubleLinkedNode));
	tempHeader->data='\0';
	tempHeader->previous = NULL;
	tempHeader->next = NULL;
	return tempHeader;
}

void printList(DLNodePtr paraHeader)//打印链表
{
	DLNodePtr p = paraHeader->next;
	while (p != NULL) {
		printf("%c", p->data);
		p = p->next;
	}
	printf("\r\n");
}

void insertElement(DLNodePtr paraHeader, char paraChar, int paraPosition)//插入位置元素
{
	DLNodePtr p, q, r;
	p = paraHeader;
	for (int i = 0; i < paraPosition; i++) {
		p = p->next;
		if (p == NULL) {
			printf("The position %d is beyond the scope of the list.Cannot insert.", paraPosition);
			return;
		}
	}
	q = (DLNodePtr)malloc(sizeof(struct DoubleLinkedNode));
	q->data = paraChar;
	r = p->next;
	q->next = p->next;
	p->next = q;
	if (r != NULL) {
		r->previous = q;
	}
}

void deleteElement(DLNodePtr paraHeader, char paraChar)//删除元素
{
	DLNodePtr p,q,r;
	p = paraHeader;
	while ((p->next != NULL) && (p->next->data != paraChar)) {
		p = p->next;
	}
	if (p->next == NULL) {
		printf("The char %c does not exist.\r\n", paraChar);
		return;
	}
	q = p->next;
	r = q->next;
	p->next = r;
	if (r != NULL) {
		r->previous = p;
	}
	free(q);
}

void locateElement(DLNodePtr paraHeader, int Position)
{
		DLNodePtr p = paraHeader;
		for (int i = 0; i < Position; i++) {
			p = p->next;
			if (p == NULL) {
				printf("The position is beyond the scope of the list.\r\n");
				return;
			}
		}
		printf("The data of the position %d is %c.\r\n",Position, p->data);
}

void insertDeleteTest()//插入删除测试
{
	DLNodePtr tempList = initLinkList();
	printList(tempList);

	insertElement(tempList, 'H', 0);
	insertElement(tempList, 'e', 1);
	insertElement(tempList, 'l', 2);
	insertElement(tempList, 'l', 3);
	insertElement(tempList, 'o', 4);
	insertElement(tempList, '!', 5);
	printList(tempList);

    locateElement(tempList,2);
	
	deleteElement(tempList, 'e');
	deleteElement(tempList, 'a');
	deleteElement(tempList, 'o');
	printList(tempList);

	locateElement(tempList, 3);

	insertElement(tempList, 'o', 1);
	printList(tempList);

}

void basicAddressTest()//基本地址测试
{
	DLNode tempNode1, tempNode2;

	tempNode1.data = 4;
	tempNode1.next = NULL;

	tempNode2.data = 6;
	tempNode2.next = NULL;

	printf("The first node: %d, %d, %d\r\n",&tempNode1, &tempNode1.data, &tempNode1.next);
	printf("The second node: %d, %d, %d\r\n",&tempNode2, &tempNode2.data, &tempNode2.next);

	tempNode1.next = &tempNode2;
}

void  main()
{
	insertDeleteTest();
	basicAddressTest();
}

加入了locateElement函数之后的运行结果：

 

 双链表是相对于单链表增加了前驱，链式的前驱和后继两个方向组成的链式结构。双向链表是一种复杂但高效的数据结构，每个节点包含前驱和后继指针，支持双向遍历。它具备动态性，可在运行时动态添加、删除和修改节点。尽管空间利用率略低于单向链表，但双向链表在插入和删除操作时的高效性以及双向遍历能力使其在某些场景中非常有用。

图解：