数据结构 C 双向链表

 1.双向链表存储结构

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

2.双向链表初始化 

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

3.打印双向链表 

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 

4.在双向链表中插入元素 

void insertElement(DLNodePtr paraHeader, char paraChar, int paraPosition){
    DLNodePtr p, q, r;

    // Step 1. Search to the position.
    p = paraHeader;
    for (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

5.删除双向链表中的元素 

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是否为空？因为删除的可能是最后一个元素 
        r->previous = p;
    }// Of if

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

6.函数增删元素功能测试 

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

    // Step 2. Add some characters.
    insertElement(tempList, 'H', 0);//bug:如果输入的是1而不是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

7.地址打印 

 void basicAddressTest(){//注意此处引用结构体变量只能用圆点运算符（不能用->），只有指向结构体类型的指针才能都用 
    DLNode tempNode1, tempNode2;

    tempNode1.data = 4;//注意4和'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

 1.老师的代码（略加修改）

#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;
int i; 
/**
 * 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 (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是否为空？因为删除的可能是最后一个元素 
		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);//bug:如果输入的是1而不是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;//注意4和'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

 运行结果（不注释掉basicAddressTest 程序返回值不为0）

 若注释掉insertElement(tempList, 'H', 0)后续测试全部错误

图解Insert: 

前插 

尾插 

 二.我的代码  

locateElement 函数 

DLNodePtr locateElement(DLNodePtr paraHeader,char paraChar){
	DLNodePtr p=paraHeader->next;//p指向首元结点
	while(p->data!=paraChar && p->next!=NULL){
		p=p->next;
	}//Of while
	if(p->next==NULL){
		printf("%c does not exist",paraChar);
		return NULL;
	}
	return p;
}//Of locateElement

#include<stdio.h>
#include<malloc.h>
#define ElemType char
/**
 * Double linked list of integers. The key is char.
 */
typedef struct DoubleLinkedNode{
	 ElemType data;
	 struct DoubleLinkedNode *prior;
	 struct DoubleLinkedNode *next;
}DLNode,*DLNodePtr;
int i;
/**
 * Initialize the list with a header.
 * @return The pointer to the header.
 */
DLNodePtr initLinkList(){
	DLNodePtr tempHeader=(DLNodePtr)malloc(sizeof(DLNode));
	tempHeader->data='\0';
	tempHeader->next=NULL;
	tempHeader->prior=NULL;
	return tempHeader;
}// Of initLinkList
/**
 * Print the list.
 * @param paraHeader The header of the list.
 */
void printList(DLNodePtr paraHeader){
	DLNodePtr p=paraHeader->next;//p指向首元节点 而非头结点 
	while(p!=NULL){
		printf("%c",p->data);
		p=p->next;
	}//Of while
	printf("\r\n");//为啥要用\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,ElemType paraChar,int paraPosition){
	DLNodePtr p,q;
	
	//Step 1.Search to the position.
	p=paraHeader;
	for(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(DLNode));
	q->data=paraChar;
	
	//Step 3.Linking.
	q->next=p->next;
	q->prior=p;
	p->next=q;//注意别只关注了新结点的指针，不要忘了原来的指针也需要修改 
	
	return;
}//Of insertElement

/**
 * Delete an element from the list.
 * @param paraHeader The header of the list.
 * @param paraChar The given char.
 */
void deleteElement(DLNodePtr paraHeader,ElemType paraChar){//不需要所在元素的位置，因为删除这个元素你并不知道它在哪 
	DLNodePtr p,q;
	p=paraHeader->next;
	
	//Step 1.Search the position.
	while(p->data!=paraChar && p->next!=NULL){//如果删除的是恰好是最后一个字符呢？ 会说删不掉 
		p=p->next;
	}//Of while
	if(p->next==NULL){
		printf("Not found %c ,cannot delete it\r\n",paraChar);
		return;
	}//Of if
	
	//Step 2.Now delete.
	p->prior->next=p->next;
	p->next->prior=p->prior;
	free(p);//是否必须释放？ 
} //Of deleteElement

DLNodePtr locateElement(DLNodePtr paraHeader,char paraChar){
	DLNodePtr p=paraHeader->next;//p指向首元结点
	while(p->data!=paraChar && p->next!=NULL){
		p=p->next;
	}//Of while
	if(p->next==NULL){
		printf("%c does not exist",paraChar);
		return NULL;
	}
	return p;
}//Of locateElement

/**
 * Unit test.
 */
void insertDeleteTest(){
	//Step 1. Initialize an empty list. 
	DLNodePtr tempList=initLinkList();
	//Step 2. Add some characters.Test the inserted function.
	insertElement(tempList,'H',0);//Position只能输入对应数组下标 
	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,'i',1);
	printList(tempList);
	//Step 5.Locate the given element.
	printf("The location of the element 'l' :%d\r\n",locateElement(tempList,'l'));
}//Of insertDeleteTest 
/**
 * Address test: beyond the book.
 */
void basicAddressTest(){
	DLNode tempNode1,tempNode2;
	tempNode1.data='4';
	tempNode1.next=NULL;
	tempNode1.prior=NULL;
	tempNode2.data='6';
	tempNode2.next=NULL;
	tempNode2.prior=NULL;
	//相比'\n'，'\r\n'好处？ 
	printf("The tempNode%d: &tempNode:%d &tempNode.next:%d &tempNode.prior:%d. \r\n",1,&tempNode1,&tempNode1.next,&tempNode1.prior);
	printf("The tempNode%d: &tempNode:%d &tempNode.next:%d &tempNode.prior:%d. \r\n",2,&tempNode2,&tempNode2.next,&tempNode2.prior);
	tempNode1.next = &tempNode2;//作用？ 
	return;
}// Of basicAddressTest
/**
 * Locate an element from the list.
 * @param paraHeader The header of the list.
 * @param paraChar The given char.
 */

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

运行结果