数据结构我好爱：03双向链表

双向链表仅仅只是单链表的延伸！

理解了单链表会觉得双链表很合理！

直接上代码：(代码大多没有考虑奇奇怪怪的数字边界，大家都懂的，没意思！！！)

结构体的定义：顾名思义，双向链表需要两个指针用于指向前驱和后继两个结点。

typedef struct node {
	int data;
	struct node* pre, *rear;
}DL,*DLPtr;

初始化：虚拟头结点的创建，其数据域为-1.

DLPtr Initialize() {
	DLPtr head = (DLPtr)malloc(sizeof(DL));
	head->data = -1;
	head->pre = NULL;
	head->rear = NULL;
	return head;
}

打印结点值：
        正向打印：通过rear指针往后

void PrintDL(DLPtr head) {
	DLPtr p = head->rear;
	while (p) {
		printf("%d ", p->data);
		p = p->rear;
	}
	putchar('\n');
}

        反向打印：通过pre指针向前，前提是找到tail尾结点 

DLPtr find_tail(DLPtr head) {
	DLPtr p = head;
	while (p->rear) {
		p = p->rear;
	}
	return p;
}

void PrintDL_reverse(DLPtr tail) {
	DLPtr p = tail;
	while (p) {
		printf("%d ", p->data);
		p = p->pre;
	}
	putchar('\n');
}

插入结点：

        简单的理解逻辑即可，特殊情况：有可能直接在末尾插入

void Insert(DLPtr head,int data) {//insert from tail
	DLPtr q = (DLPtr)malloc(sizeof(DL));
	q->data = data;
	q->rear = NULL;
	DLPtr p = head->rear;
	if (p == NULL) {
		head->rear = q;
		q->pre = head;
	}
	else {
		while (p->rear) {
			p = p->rear;
		}
		p->rear = q;
		q->pre = p;
	}
}

删除结点: 常规操作，pass

void DeleteNode(DLPtr head,int po) {
	DLPtr p = head,q;
	for (int i = 0; i < po; i++) {
		p = p->rear;
	}
	q = p->rear;
	if (q->rear == NULL) {
		free(q);
		return;
	}
	p->rear = p->rear->rear;
	p->rear->pre = p->pre;
	free(q);
}

运行截图：

完整代码：

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

typedef struct node {
	int data;
	struct node* pre, *rear;
}DL,*DLPtr;

DLPtr Initialize() {
	DLPtr head = (DLPtr)malloc(sizeof(DL));
	head->data = -1;
	head->pre = NULL;
	head->rear = NULL;
	return head;
}

void PrintDL(DLPtr head) {
	DLPtr p = head->rear;
	while (p) {
		printf("%d ", p->data);
		p = p->rear;
	}
	putchar('\n');
}

void PrintDL_reverse(DLPtr tail) {
	DLPtr p = tail;
	while (p) {
		printf("%d ", p->data);
		p = p->pre;
	}
	putchar('\n');
}

void Insert(DLPtr head,int data) {//insert from tail
	DLPtr q = (DLPtr)malloc(sizeof(DL));
	q->data = data;
	q->rear = NULL;
	DLPtr p = head->rear;
	if (p == NULL) {
		head->rear = q;
		q->pre = head;
	}
	else {
		while (p->rear) {
			p = p->rear;
		}
		p->rear = q;
		q->pre = p;
	}
}

void DeleteNode(DLPtr head,int po) {
	DLPtr p = head,q;
	for (int i = 0; i < po; i++) {
		p = p->rear;
	}
	q = p->rear;
	if (q->rear == NULL) {
		free(q);
		return;
	}
	p->rear = p->rear->rear;
	p->rear->pre = p->pre;
	free(q);
}

DLPtr find_tail(DLPtr head) {
	DLPtr p = head;
	while (p->rear) {
		p = p->rear;
	}
	return p;
}

void Test() {
	int a[] = { 1,2,4,7,22,0,5,11,7,4,9 };
	DLPtr head = Initialize();
	for (int i = 0; i < 8; i++) {
		Insert(head, a[i]);
	}
	DeleteNode(head, 0);
	PrintDL(head);
	DLPtr tail = find_tail(head);
	PrintDL_reverse(tail);
}

int main() {
	Test();
	return 0;
}

 老师代码：yyds

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

/**
 * Double linked list of integers. The key is char.
 */
typedef struct DoubleLinkedNode{
	char data;
	struct DoubleLinkedNode *previous;
	struct DoubleLinkedNode *next;
} DLNode, *DLNodePtr;

/**
 * Initialize the list with a header.
 * @return The pointer to the header.
 */
DLNodePtr initLinkList(){
	DLNodePtr tempHeader = (DLNodePtr)malloc(sizeof(struct DoubleLinkedNode));
	tempHeader->data = '\0';
	tempHeader->previous = NULL;
	tempHeader->next = NULL;
	return tempHeader;
}// Of initLinkList

/**
 * Print the list.
 * @param paraHeader The header of the list.
 */
void printList(DLNodePtr paraHeader){
	DLNodePtr p = paraHeader->next;
	while (p != NULL) {
		printf("%c", p->data);
		p = p->next;
	}// Of while
	printf("\r\n");
}// Of printList

/**
 * Insert an element to the given position.
 * @param paraHeader The header of the list.
 * @param paraChar The given char.
 * @param paraPosition The given position.
 */
void insertElement(DLNodePtr paraHeader, char paraChar, int paraPosition){
	DLNodePtr p, q, r;

	// Step 1. Search to the position.
	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;
		}// Of if
	} // Of for i

	// Step 2. Construct a new node.
	q = (DLNodePtr)malloc(sizeof(struct DoubleLinkedNode));
	q->data = paraChar;

	// Step 3. Now link.
	r = p->next;
	q->next = p->next;
	q->previous = p;
	p->next = q;
	if (r != NULL) {
		r->previous = q;
	}// Of if
}// Of insertElement

/**
 * Delete an element from the list.
 * @param paraHeader The header of the list.
 * @param paraChar The given char.
 */
void deleteElement(DLNodePtr paraHeader, char paraChar){
	DLNodePtr p, q, r;
	p = paraHeader;

	// Step 1. Locate.
	while ((p->next != NULL) && (p->next->data != paraChar)){
		p = p->next;
	}// Of while

	// Step 2. Error check.
	if (p->next == NULL) {
		printf("The char '%c' does not exist.\r\n", paraChar);
		return;
	}// Of if

	// Step 3. Change links.
	q = p->next;
	r = q->next;
	p->next = r;
	if (r != NULL) {
		r->previous = p;
	}// Of if

	// Step 4. Free the space.
	free(q);
}// Of deleteElement

/**
 * Unit test.
 */
void insertDeleteTest(){
	// Step 1. Initialize an empty list.
	DLNodePtr tempList = initLinkList();
	printList(tempList);

	// Step 2. Add some characters.
	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);

	// Step 3. Delete some characters (the first occurrence).
	deleteElement(tempList, 'e');
	deleteElement(tempList, 'a');
	deleteElement(tempList, 'o');
	printList(tempList);

	// Step 4. Insert to a given position.
	insertElement(tempList, 'o', 1);
	printList(tempList);
}// Of appendInsertDeleteTest

/**
 * Address test: beyond the book.
 */
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;
}// Of basicAddressTest

/**
 * The entrance.
 */
void main(){
	insertDeleteTest();
	basicAddressTest();
}// Of main