数据结构——双向链表

代码如下：

#include <iostream>
#include <malloc.h> 
using namespace std;
typedef struct DoubleLinkedNode {
	char data;
	struct DoubleLinkedNode* previous;
	struct DoubleLinkedNode* next;
}DLNode, * DLNodePtr;

DLNodePtr initLinkList() {
	DLNodePtr tempHeader = (DLNodePtr)malloc(sizeof(DLNode));
	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.", paraPosition);
			return;
		}
	}

	q = (DLNodePtr)malloc(sizeof(DLNode));
	q->data = paraChar;

	r = p->next;
	q->next = p->next;
	p->next = q;
	q->previous = p;
	if (r != NULL) {
		r->previous = q;
	}

}
void deleteElement(DLNodePtr paraHeader, char paraChar) {
	DLNodePtr q, p, 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 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);


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

	insertElement(tempList, 'o', 1);
	printList(tempList);
}
int main() {
	printf("0");
	insertDeleteTest();
	return 0;
}

运行结果如下：