c语言双向循环链表

双向循环链表：
#include<stdio.h>
typedef int elemtype;
typedef struct dupnode
{elemtype data;
struct dupnode *next,*prior;
} dulinklist;
dulinklist *creatlist()
{char ch;int x;
dulinklist *head,*r,*p;
p=(dulinklist*)malloc(sizeof(dulinklist)); head=p;
p->next=head;
p->prior=p;
r=p;
ch=getchar();
while(ch!='?')
{scanf("%d",&x);
p=(dulinklist*)malloc(sizeof(dulinklist));
p->data=x;
p->prior=r;
p->next=head;
r->next=p;
吗r=r->next;
printf("%d,%x,%x\n",x,p->prior->next,p->prior->prior);
ch=getchar();
}
return(head);
}
void main()
{creatlist();
}
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
using namespace std;
int n;
typedef struct node
{
int data;
struct node *prior;
struct node *next;
}node,*DoubleLinkList;
void Creat_List(DoubleLinkList L) {
DoubleLinkList r,s;
cout<<"请输入n的值"<<endl;
cin>>n;
s = L;
s->prior = s;
s->data = n;
for(int i=0;i<n;i++)
{
r = (DoubleLinkList)malloc(sizeof(node)); L->next = r;
r->next = s->next;
r->prior = L;
s->next->prior = r;
r->data = i;
L = r;
}
}
void Desplay_List(DoubleLinkList L)
{
DoubleLinkList p;
p = L->next;
for(int i=0;i<n;i++)
{
cout<<"输出:"<<p->data<<endl; p = p->next;
}
}
void Destroy_List(DoubleLinkList L) {
DoubleLinkList p;
p = L;
node *temp;
for(int k=0;k<n;k++)
{
p = L->next;
temp = p->next;
temp->prior->next = temp->next; temp->next->prior = temp->prior; free(temp);
}
cout<<"空间释放成功"<<endl;
}
void main()
{
node a;
DoubleLinkList p;
p = &a;
Creat_List(p);
Desplay_List(p);
Destroy_List(p);
}
#include <stdio.h>
#include <stdlib.h>
typedef struct node
{
int data;
struct node *pri; //前驱
struct node *next; //后驱
}List;
bool Insert(List *list, int index, int value) {
//查找要插入的位置的前一个
int i = 0;
while( list && i < (index-1) )
{
list = list->next;
i++;
}
if( list==NULL || i > (index-1) )
{
printf("插入位置不正确, insert failed");
return false;
}
node* new_node = (node*)malloc(sizeof(node)); if(new_node == NULL)
{
printf("malloc new node memery fail\n");
return false;
}
new_node->data = value;
new_node->pri = list;
new_node->next = list->next;
list->next = new_node;
list->next->pri = new_node;
return true;
}
bool DelNote(List *list, int index)
{
//查找要插入的位置的前一个
int i = 0;
while( list && i < (index-1) )
{
list = list->next;
i++;
}
if( list==NULL || i > (index-1) )
{
printf("删除位置不正确, insert failed");
return false;
}
node* p = list->next;
list->next = list->next->next;
list->next->pri = list;
printf("delete node value:%d \n",p->data); free(p);
return true;
}
void Print(List *list)
{
if(list->next == NULL)
{
printf("list is empty!\n"); return ;
}
while(list->next)
{
list = list->next;
printf("%d ", list->data); }
}
int main()
{
List list;
//构建头结点
list.data = 0;
list.next = NULL;
list.pri = NULL;
// Print(&list);
int i = 1;
bool flag = false;
while(i<10)
{
flag =Insert(&list, i, i);
if(!flag)
{
printf("insert failed!!\n");
}
i++;
}
Print(&list);
printf("enter delete node index \n");
int index;
scanf("%d", &index);
flag = DelNote(&list, index);
if(flag)
printf("delete note success!!\n"); Print(&list);
return 0;
}。