ps:本文函數名使用中文拼音命名，僅用於方便個人學習，實際項目編程中請勿使用拼音命名方法。
雙鏈表編程
#include <
stdio.h>
#include <
stdlib.h>
//雙鏈表節點
struct
node
{
int num;
//有效數據
struct node *pPrev;
//前向指針
struct node *pNext;
//後向節點
};
struct node *create_node(int
num)//創建節點
{
struct node *p=(struct node
*)malloc(sizeof(struct node));
if(NULL==p)
{
printf("malloc
error\n");
return NULL;
}
p->num=num;
p->pPrev=NULL;
p->pNext=NULL;
return p;
}
//將雙鏈表新節點插入前一個節點的尾部
void insert_tail(struct node
*pHeader,struct node *new)//尾插入函數
{
//1、先走到鏈表的尾節點
struct node
*p=pHeader;
while(NULL!=p->pNext)
{
p=p->pNext;
}
//2、將新節點插入到原來尾節點的後面
p->pNext =
new;//後向指針關聯：新節點地址賦給前節點的next
new->pPrev =
p;//前向指針關聯:前節點的地址與新節點的prev相綁
}
void insert_head(struct node
*pHeader,struct node *new)//頭插入函數
{
struct node
*p=pHeader;
//後向鏈接
new->pNext=p->pNext;//原來第一個節點地址綁定到新節點的next
if(NULL!=p->pNext)
//判斷新節點是否爲第一個節點
p->pNext->pPrev=new;//來自下面前向鏈接，作用：原來第一個有效節點的prev指針指向新節點的地址
p->pNext=new;
//新節點地址綁定到頭節點的next
//前向鏈接
new->pPrev=p;
//新節點prev綁定頭節點地址
//p->pNext->pPrev=new;
//原來第一個有效節點的prev指針指向新節點的地址
//遷移到上面因爲p->pNext已經被改爲new了
}
void bianli(struct node
*pHeader)//後向遍歷函數
{
struct node
*p=pHeader;
while(NULL!=p->pNext)
{
p = p->pNext;
printf("num =
%d\n",p->num);
}
}
void qianxiang_bianli(struct
node *pTail)//前向遍歷函數，參數pTail指向鏈表末尾
{
struct node
*p=pTail;
while(NULL!=p->pPrev)
{
printf("num =
%d\n",p->num);
p = p->pPrev;
}
}
int delete(struct node
*pHeader,int num)//刪除節點函數
{
struct node
*p=pHeader;
while(NULL!=p->pNext)
{
p =
p->pNext;
if(num==p->num)
{
//1、找尾節點並刪除
if(NULL==p->pNext)
{
p->pPrev->pNext=NULL;
//p->pPrev =
NULL;
free(p);
}
//2、找普通節點並刪除，與前向節點和後向節點都有關聯
else
{
//後向鏈接：前一個節點的next指針指向要刪除節點的後一個節點的首地址
p->pPrev->pNext=p->pNext;
//前向鏈接:要刪除節點的後一個節點的prev指向目標節點的前一個節點的地址
p->pNext->pPrev =
p->pPrev;
free(p);
}
return 0;
}
}
printf("Not
Finding\n");
return -1;
}
int main ()
{
struct node *pHeader =
create_node(0);//將頭指針指向頭節點
insert_tail(pHeader,create_node(11));
//數字任意
insert_tail(pHeader,create_node(13));
insert_tail(pHeader,create_node(15));
bianli(pHeader);
//後向遍歷函數
delete(pHeader,13);
//調用刪除節點函數
printf("After
delete\n");
bianli(pHeader);
//顯示遍歷結果
/ *3、前向遍歷函數遍歷
struct node
*p1=pHeader->pNext->pNext->pNext;
qianxiang_bianli(p1);
* /
/ *2、後向遍歷
printf("node1
num:%d\n",pHeader->pNext->num);
printf("node2
num:%d\n",pHeader->pNext->pNext->num);
printf("node3
num:%d\n",pHeader->pNext->pNext->pNext->num);
* /
/ *1、前向遍歷
struct node
*p=pHeader->pNext->pNext->pNext;
printf("node3
num:%d\n",p->num);
printf("node2
num:%d\n",p->pPrev->num);
printf("node1
num:%d\n",p->pPrev->pPrev->num);
* /
}