单链表插入删除等操作

#include "stdafx.h"
#include<iostream>
using namespace std;
typedef struct student//定义链表结构体
{
int data;
struct student *next;
}node;
node *creat()//建立链表
{
node *head,*p,*s;
int x,cycle=1;
head=(node*)malloc(sizeof(node));
p=head;
while(cycle)
{
cout<<"请输入data"<<endl;
cin>>x;
if(x!=0)
{
s=(node*)malloc(sizeof(node));
s->data=x;
p->next=s;
p=s;
}
else
cycle=0;
}
head=head->next;
p->next=NULL;
cout<<"返回的头指针指向数据为"<<head->data<<endl;
return(head);
}
//链表测长
int length(node *head)
{
int n=1;
node *p;
p=head;
while(p->next!=NULL)
{
p=p->next;
n++;
}
return(n);
}
//打印链表
void print(node *head)
{
node *p;
int n;
n=length(head);
cout<<"链表长度是"<<n<<endl;
p=head;
if(head!=NULL)
while(p!=NULL)
{
cout<<(p->data)<<endl;
p=p->next;
}
}
//删除节点
node* del(node *head,int num)
{
node *p1=head;
node *p2;
while(num!=p1->data&&p1->next!=NULL)
{
p2=p1;
p1=p1->next;
}
if(num==p1->data)
{
if(p1==head)
{
head=p1->next;
//free(p1);
}
else
{
p2->next=p1->next;
}
}
else
cout<<"没有找到"<<endl;
return(head);
}
//插入节点
node* insert(node *head,int num)
{
node *p1,*p0,*p2;
p1=head;
p0=(node*)malloc(sizeof(node));
p0->data=num;
while(p0->data>p1->data&&p1->next!=NULL)
{
p2=p1;
p1=p1->next;
}
if(p0->data<=p1->data)
{
if(head==p1)
{
p0->next=p1;
head=p0;
}
else
{
p0->next=p1;
p2->next=p0;
}
}
else
{
p1->next=p0;
p0->next=NULL;

}
return(head);
}
node *insert2(node *head,int num)
{
node *p0,*p1,*p2;
p1=head;
p0=(node*)malloc(sizeof(node));
p0->data=num;
int n;
cout<<"请输入节点"<<endl;
cin>>n;
while((n-1)&&(p1->next!=NULL))
{
p2=p1;
p1=p1->next;
n--;
}
if(p1==head)
{
head=p0;
p0->next=p1;

}
else
{
p2->next=p0;
p0->next=p1;
}
    return(head);
}
//单链表排序
node *sort(node *head)
{
node *p;
p=head;
int n=length(head);
int temp;
for(int j=1;j<n;j++)
{
p=head;
for(int i=0;i<n-j;i++)
{
if(p->data>p->next->data)
{
temp=p->data;
p->data=p->next->data;
p->next->data=temp;
}
p=p->next;
}
}
return(head);
}
//单链表逆置
node *reverse(node *head)
{
node *p1,*p2,*p3;
//边界检查
if(head==NULL||head->next==NULL)
return head;
p1=head;
p2=p1->next;
while(p2)
{
p3=p2->next;
p2->next=p1;
p1=p2;
p2=p3;
}
head->next=NULL;
head=p1;
return head;


}
int _tmain(int argc, _TCHAR* argv[])
{

    node *head;
head=creat();
head=reverse(head);
print(head);



return 0;
}