双向链表

#include <iostream>
#include<stdlib.h>
using namespace std;
typedef struct student
{
 int data;
 struct student *pre;
 struct student *next;
}node;
node *creat()
{
 int cycle=1,x;
 node *head,*p,*s;
 head=(node*)malloc(sizeof(node));
 p=head;
 while(cycle)
 {
  s=(node*)malloc(sizeof(node));
  cout<<"please input one number"<<endl;
  cin>>x;
  if(x!=0)
  {
  s->data=x;
  s->pre=p;
  p->next=s;
  p=s;
  }
  else cycle=0;
 }
 head=head->next;
 head->pre=NULL;
 p->next=NULL;
 return (head);
}
void visit(node *head)
{
 node *p;
 p=head;
 while(p!=NULL)
 {
 
  cout<<p->data<<endl;
  p=p->next;
 }

}
node* del(node *head,int num)
{
 node *p;
 p=head;
 while(p->data!=num&&p->next!=NULL)
 {
  p=p->next;
 }
 if(p->data==num)
 {
  if(p==head)
  {
   head=head->next;
   head->pre=NULL;
   free(p);
  }
  else if(p->next==NULL)
  {
   p->pre->next=NULL; 
   free(p);
  }
  else
  {
   p->pre->next=p->next;
   p->next->pre=p->pre;
  }
 }
 else
 {
 cout<<"the number cannot found"<<endl;
 }
 return (head);
}
void main()
{
 node *head;
 head=creat();
 visit(head);
 head=del(head,5);
 cout<<endl;
 visit(head);
}