c++ 链表

#include<iostream>
#include<vector>
using namespace std;


typedef struct student
{
int data;
struct student *next;
}node;
class list
{
public:
node * create()
{
node *head,*p,*s;
int x,cycle = 1;
head = new node;
p = head;
while(cycle)
{
cout<<"input the data:"<<endl;
cin>>x;
if(x!=0)
{
s = new node;
s->data = x;
p->next = s;
p = s;
}
else
{
cycle = 0;
}
}
s->next = NULL;
head = head->next;
return head;
}
int length(node *head)
{
int n = 0;
node *p;
p = head;
while(p != NULL)
{
n++;
p = p->next;
}
return n;
}
void travseral(node * head)
{
node *p = head;
while(p !=NULL)
{
cout<<p->data<<endl;
p = p->next;
}
}
//单链表逆置
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;
}


node *insert(node *head,int num)
{
node *p0,*p1,*p2;
p1 = head;
p0 = new 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
{
p2->next = p0;
p0->next = p1;
}
}
else
{
p1->next = p0;
p0->next = NULL;
}
return head;


}


node *remove(node *head,int num)
{
node *p1,*p2;
p1 = head;
while(num != p1->data && p1->next != NULL)
{
p2 = p1;
p1 = p1->next;
}
if(num == p1->data)
{
if(p1 == head)
{
head = p1->next;
delete p1;
}
else
{
p2->next = p1->next;
}
}
else
{
cout<<"not found"<<endl;
}
return head;
}


/*void ReverseList(node * ListHead)
{
cout<<"Begin to Reverse the List"<<endl;
// if( (NULL == ListHead)||(NULL== ListHead->next) )
// return ;  //边界检测
node* pPre=ListHead;    //先前指针
node* pCur=pPre->next;  //当前指针
node* pNext=NULL;       //后继指针
while(pCur!=NULL)
{
pNext=pCur->next;
pCur->next=pPre;
pPre=pCur;
pCur=pNext;
}
ListHead->next=NULL;
ListHead=pPre;        //记录下新的头结点
}*/


void searchmid(node *head,node *mid)
{
node *p,*q;
p = head;
q = head;
while(p->next->next != NULL)
{
p = p ->next->next;
q = q->next;
mid = q;
}
}
};
int main()
{
list m_list;
node *head = m_list.create();
cout<<m_list.length(head)<<endl;
m_list.travseral(head);
head = m_list.reverse(head);
cout<<"list reverse"<<endl;
m_list.travseral(head);
system("pause");


return 0;
}