双向循环链表

双向链表节点有两个指针域，一个前驱指针，一个指向后继指针。且链表中第一个节点前驱节点为NULL，最后一个节点后继节点为NULL。

// myLink.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include <stdlib.h>

typedef struct bidir_link_list {
	struct bidir_link_list *prior;
	int data;
	struct bidir_link_list *next;
}bilist;

bilist* initList(bilist * head);
bilist* insertList(bilist * head, int data, int add);
bilist* delList(bilist * head, int data);
void display(bilist * head);

int main()
{
	bilist * head = NULL;
	head = initList(head);

	head = insertList(head, 9, 5);
	display(head);
	head = delList(head,9);
	display(head);

	getchar();
    return 0;
}

bilist* initList(bilist * head){
	head = (bilist*)malloc(sizeof(bilist));
	head->prior = NULL;
	head->next = NULL;
	head->data = 1;
	bilist *list = head;
	int i;
	for (i = 2; i <= 8; i++) {
		bilist * body = (bilist*)malloc(sizeof(bilist));
		body->prior = NULL;
		body->next = NULL;
		body->data = i;

		list->next = body;
		body->prior = list;
		list = list->next;
	}
	return head;
}

bilist* insertList(bilist * head, int data, int add){
	//新建节点
	int i;
	bilist *temp = (bilist*)malloc(sizeof(bilist));
	temp->data = data;
	temp->prior = NULL;
	temp->next = NULL;

	//插入到链表头
	if (1 == add) 
	{
		temp->next = head;
		head->prior = temp;
		head = temp;
	}
	else // 插入到add的前一个位置
	{
		bilist *body = head;
		
		for (i = 1; i < add - 1; i++) 
		{
			body = body->next;
			printf("body!\n");
		}

		if (NULL == body->next) // 插入链表尾
		{
			body->next = temp;
			temp->prior = body;
		}
		else //插入要位置的前一个节点
		{
			body->next->prior = temp;
			temp->prior = body;
			temp->next = body->next;
			body->next = temp;
		}
	}

	return head;
}

bilist* delList(bilist * head, int data)
{
	bilist* temp = head;

	//遍历链表
	while (temp)
	{
		//判断当前节点数据域与data值是否相等，若相等，删除该节点
		if (data == temp->data)
		{
			temp->next->prior = temp->prior;
			temp->prior->next = temp->next;
			free(temp);
			return head;
		}
		temp = temp->next;
	}
	printf("链表中无此数据！\n");
	return head;
}

void display(bilist * head){
	bilist* temp = head;
	while (temp)
	{
		if (NULL == temp->next)
		{
			printf("%d\n", temp->data);
		}
		else
		{
			printf("%d->",temp->data);
		}
		temp = temp->next;
	}
}

 输出：