c 双链表的实现

怼烎@ 2024-04-19 07:32 50阅读 0赞

\#include <stdio.h>  
\#include <stdlib.h>  
  
  
typedef struct \_double\_linklist\_\{  
int data;  
struct \_double\_linklist\_ \*pre,  
\*next;  
\}DlinkNode;  
  
  
DlinkNode \*creat\_dlinknode(int value);  
DlinkNode \*creat\_dlinklist(void);  
int insert\_dlinklist(DlinkNode \*head, int value);  
int delet\_dlinklist(DlinkNode \*head, int obj);  
int show\_dlinklist(DlinkNode \*head);  
int free\_dlinklist(DlinkNode \*head);  
  
  
int main()  
\{  
DlinkNode \*head = NULL;  
int i;  
  
  
head = creat\_dlinklist();  
for(i = 0; i < 10; i ++)  
insert\_dlinklist(head, 100 + i);  
show\_dlinklist(head);  
delet\_dlinklist(head, 1000);  
show\_dlinklist(head);  
free\_dlinklist(head);  
return 0;  
\}  
  
  
DlinkNode \*creat\_dlinknode(int value)  
\{  
DlinkNode \*node = NULL;  
  
  
node = (DlinkNode \*)malloc(sizeof(DlinkNode));  
node->data = value;  
node->next = NULL;  
node->pre = NULL;  
  
  
return node;  
\}  
  
  
DlinkNode \*creat\_dlinklist(void)  
\{  
return creat\_dlinknode(0);   
\}  
  
  
int insert\_dlinklist(DlinkNode \*head, int value)  
\{  
DlinkNode \*node = NULL;  
  
  
node = creat\_dlinknode(value);  
node->next = head->next;  
if(NULL != head->next)  
(head->next)->pre = node;  
node->pre = head;  
head->next = node;  
  
  
return 0;  
\}  
  
  
int show\_dlinklist(DlinkNode \*head)  
\{  
DlinkNode \*p = head;  
  
  
if(NULL == head->next)  
return -1;  
  
  
do\{  
p = p->next;  
printf("%3d ", p->data);  
\}while(NULL != p->next);  
putchar('\\n');  
  
  
while(NULL != p->pre)  
\{  
printf("%3d ", p->data);  
p = p->pre;  
\}  
putchar('\\n');  
  
  
return 0;  
\}  
  
  
int delet\_dlinklist(DlinkNode \*head, int obj)  
\{  
DlinkNode \*p = head->next;  
  
  
while(NULL != p && p->data != obj)  
p = p->next;  
if(NULL == p)  
return -1;  
p->pre->next = p->next;  
if(p->next)  
p->next->pre = p->pre;  
free(p);  
return 0;  
\}  
  
  
int free\_dlinklist(DlinkNode \*head)  
\{  
DlinkNode \*tmp = NULL,  
\*p = head;  
  
  
while(NULL != p)  
\{  
tmp = p;  
p = p->next;  
free(tmp);  
\}  
return 0;  
  
\}