数据结构——双向链表

双向链表结点结构

typedef struct DoubleNode
{
    ElemType data;
    struct DoubleNode *previous;//前驱结点
    struct DoubleNode *next;//后继结点
}DoubleNode,*DLinkList;

 双向链表插入操作：

 

1. q->next = p;
2. q->previous = p->previous;
3. p->previous->next = q;
4. p->previous = q;

双链表的删除操作：

1. p->previous->next = p->next;
2. p->next->previous = p->previous;
3. free(p);

 老师代码

#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;
	}
	printf("\r\n");
}
/**
 * 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;
		}
	}

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

	// Step 3. Now link.
	r = p->next;
	q->next = r;
	q->previous = p;
	p->next = q;
	
	if (r != NULL)
	{
		r->previous = q;
	}
}
/**
 * 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;
	}
	//Step 2.Error check.
	if (p->next == NULL)
	{
		printf("The char '%c' does not exist.\r\n", paraChar);
		return;
	}

	//Step 3.Change links.
	q = p->next;
	r = q->next;
	p->next = r;
	if (r != NULL)
	{
		r->previous = p;
	}
	//Step 4. Free the space
	free(q);
}
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

代码运行结果：

Hello!
The char 'a' does not exist.
Hll!
Holl!
The first node: 1703632, 1703632, 1703640
The second node: 1703620, 1703620, 1703628
Press any key to continue

自己实现locateElement 函数：

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

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

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;
	// 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;
		}
	}

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

	// Step 3. Now link.
	r = p->next;
	q->next = r;
	q->previous = p;
	p->next = q;

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

int main() {
	DLNodePtr tempList = initLinkList();
	printList(tempList);
	insertElement(tempList, '0', 0);
	insertElement(tempList, '1', 1);
	insertElement(tempList, '2', 2);
	insertElement(tempList, '3', 3);
	insertElement(tempList, '4', 4);
	insertElement(tempList, '5', 5);
	printList(tempList);
	int n;
	n = 6;
	char paraValue;
	printf("请输入要找的元素\n");
		scanf_s("%c", &paraValue);
	int i = 1;
	while ((tempList->next != NULL) && (tempList->next->data != paraValue))
	{
		tempList = tempList->next;
		i++;
	}
	
	if (tempList->next == NULL)
	{
		printf("The char '%c' does not exist.\r\n", paraValue);
		return 0;
	}
	printf("%d", i);
	return 0;
}

运行结果