数据结构（四）双向链表的基本操作

#include <iostream>


using namespace std;


typedef struct Node
{
int data;
struct Node *prior;
struct Node *next;
}Node;
//双向链表的创建 
Node *create(int n)
{
Node *head,*p1,*p2;
int data;
cout<<"输入创建的数据:\n";
head = new Node();
head->next= NULL;
head->prior = NULL;
p2 = head;
for(int i=0;i<n;i++)
{
p1 = new Node();
cin>>data;
p1->data = data;
p1->prior = p2;
p1->next = NULL;
p2->next = p1;
p2 = p1;
}
return head;
}
//双向链表的输出
void output(Node *head)
{
Node *p1;
p1 = head->next;
cout<<"数据为:\n";
while(p1!=NULL)
{
cout<<p1->data<<" ";
p1 = p1->next;
}
cout<<"\n";
} 
//双向链表的插入
void insert(Node *head)
{
//给定数值的前面
Node *p1,*p2;
int data;
cout<<"请输入你要插在哪个数据的前面:\n";
cin>>data;
p2 = head;
p1 = head->next;
p2 = NULL;
while(p1!=NULL)
{
if(p1->data == data)
{
break;
}
p1 = p1->next;
}
if(p1 == NULL)
{
cout<<"没有找到该数据\n";
exit(0);
}
else
{
p2 = new Node();
int data;
cout<<"请输入你要插入的数据的值:\n";
cin>>data;
p2->data = data;
p2->next = p1;
p2->prior = p1->prior;
p1->prior->next = p2;
p1->prior = p2;
}


} 
//双向链表的删除 
void delete_data(Node *head)
{
Node *p1,*p2;
int data;
p1 = head->next;
p2 = NULL;
cout<<"请输入你要删除节点的数据:\n";
cin>>data;
while(p1!=NULL)
{
if(p1->data == data)
{
break;
}
p1 = p1->next;
}
if(p1 == NULL)
{
cout<<"没有找到此数据\n";
}
else if(p1->next==NULL)
{
p1->prior->next = NULL;
delete(p1);
}
else
{
p2 = p1;
p1->prior->next = p1->next;
p1->next->prior = p1->prior;
delete(p2);
}
}
int main()
{
Node *head;
int n;
cout<<"输入链表的长度:\n";
cin>>n;
head = create(n);
//insert(head);
delete_data(head);
output(head);
return 0;
}