文章摘自朱有鹏著的代码,理解还不够深刻,用以回忆。
内容出自:书籍188页内容-191页
#include <stdio.h>
#include <stdlib.h>
struct node*list_for_each(struct node*pH);
//双链表节点
struct node
{
int data;
struct node *pPrev;
struct node *pNext;
};
struct node *create_node(int data) //创建一个节点
{
struct node*p = (struct node*)malloc(sizeof(struct node));
//系统给分配一个实际的空间,指针p的内容是其地址,*p可以表示头结点;p也是有地址的
if(NULL == p)
{
printf("malloc error.\n");
return NULL;
}
p->data = data;
p->pPrev = NULL;
p->pNext = NULL;
return p;
};
/*双链表的算法之插入节点*/
/*
intert tail(传入待插入的链表、节点)
{
第一步:
找到链表的尾节点
第二步:
将新节点接到链表尾节点后面成为新的尾部节点
(1)将原来的尾节点pNext指针指向新节点首地址
(2)新节点的pPrev指针指向原来的尾节点首地址
}
*/
void insert_tail(struct node *pH,struct node *new)
{
//第一步找到尾部节点
struct node *p = pH;
while(NULL!=p->pNext)
{
p = p->pNext;
}
//第二步骤:将新节点插入到原来尾部节点的后面
p->pNext = new;
new->pPrev = p;
}
/*头部插入*/
//当链表只有一个头结点时,调用insert_head()函数就会引发错误
void instert_head(struct node* pH,struct node *new)
{
//(1)新节点的next指针指向原来的节点1的地址
new->pNext = pH->pNext;
//(2)节点1的prev指针指向新节点地址
if(NULL!=pH->pNext)
{
pH->pNext->pPrev = new;
}
//(3)头结点的next指针指向新节点的位置
pH->pNext = new;
//(4)新节点的prev指针指向头结点的地址
new->pPrev = pH;
}
//911双向遍历-正向遍历
struct node*list_for_each(struct node*pH)
{
struct node *p = pH;
if(NULL == p)
{
return NULL;
}
while (NULL!=p->pNext)
{
p = p->pNext;
printf("data = %d.\n",p->data);
}
return p;
};
//逆向遍历
void list_for_each_reverse(struct node*pTail)
{
struct node*p = pTail;
while(NULL!=p->pPrev)
{
printf("data=%d.\n",p->data);
p = p->pPrev;
}
}
int main()
{
struct node *pHeader = create_node(0);
printf("pHeader %d.\n",*pHeader);
insert_tail(pHeader,create_node(11));
insert_tail(pHeader,create_node(12));
insert_tail(pHeader,create_node(13));
printf("正向遍历:\n");
struct node *pTail=list_for_each(pHeader);
printf("逆向遍历:\n");
list_for_each_reverse(pTail);
printf("Hello world!\n");
return 0;
}