双链表

//编程实现双链表的建立
#include <iostream>
#include <stdio.h>
#include<string.h>
#include <conio.h>
using namespace std;


typedef struct student
{
int data;
struct student *next;
struct student *pre;
}dnode;


//建立双链表
dnode * creat()
{
dnode *head,*p,*s;
int x,cycle =1;
head = (dnode*)malloc(sizeof(dnode));
p=head;
while(cycle)
{
printf("\n please imput the data: ");
scanf("%d",&x);
if (x !=0)
{
s= (dnode*) malloc(sizeof(dnode));
s->data = x;
printf("\n %d",s->data);
p->next = s;
s->pre =p;
p= s;


}
else cycle = 0;
}


head = head->next;
head->pre= NULL;
p->next =NULL;


printf("\n  yyy %d",head->data);
return (head);
}




//编程实现双链表删除结点
dnode *del(dnode *head, int num)
{
dnode *p1,*p2;
p1 = head;
while(num != p1->data && p1->next !=NULL)
{
p1=p1->next;
}


if (num == p1->data)
{


if(p1==head)//表头删除
{
head=head->next;
head->pre =NULL;
free(p1);
}
else if(p1->next == NULL)//表尾删除
{
p1->pre->next = NULL;
free(p1);
}
else//表间删除
{
p1->next->pre = p1->pre;
p1->pre->next = p1->next;
}
}
else
printf("\n %d could not been found",num);


return (head);
}


//编程实现双链表的插入
dnode *insert(dnode *head,int num)
{
dnode *p0,*p1;
p1=head;
p0=(dnode*)malloc(sizeof(dnode));
p0->data = num;
while(p0->data >p1->data && p1->next != NULL)
{
p1=p1->next;
}


//还是三种地方的删除，表头，表尾，表间
if (p0->data <= p1->data)
{
if (head == p1)
{
p0->next =p1;
p1->pre = p0;
head =p0;
}
else
{
p1->pre->next=p0;
p0->next =p1;
p0->pre=p1->pre;
p1->pre =p0;
}
}
else
{
p1->next =p0; p0->pre=p1;
p0->next=NULL;
}
}


int main()
{
dnode *head,stud;
int n,del_num,insert_num;
head = creat();
print(head);
cout < "\n nInt: ";
cin >> del_num;
head = del(head,del_num);
print(head);
cout << "\n please input the insert data :";
cin >> insert_num;
head = insert(head,insert_num);
print(head);
return 0;
}