单链表

#include <iostream>
using namespace std;

typedef struct node
{
  int val;
  struct node*next;
}node,*linklist;


node*creatlist(int&n)//back insert
{
    int a;                         
 linklist p,q;
 p=new node;
 p->val=0;
 p->next=p;
 for(int i=0;i<n;i++)
 {
         q=new node;
         cout<<"please input a number"<<endl;
         cin>>q->val;
  q->next=p->next;
  p->next=q;
}
return p;
}

node*creatlist_front(int&m)
{
 linklist a,b;
 a=new node;
 a->next=NULL;
 for(int i=0;i<m;i++)
 {
   b=new node;
   cout<<"please input the number:"<<endl;
   cin>>b->val;
  a->next=b;
  b->next=NULL;
  a=b;
}
return a;
}

  
void PrintNode(linklist L)
{      linklist p=L;
     if(L==NULL)
     {
       cerr<<"can't find the node"<<endl;
       exit(1);
       }
       do
        {
    cout<<"-----"<<p->val;
    cout<<"-----";
    p=p->next;
}
  while(p!=L);
 
}

node*insertnode(int x,linklist L)
{
     linklist k;
 
     k=new node;               
  for(int i=0;i<x;i++)
  {
   L=L->next;
}
cout<<"please input a number a"<<endl;
cin>>k->val;
k->next=L->next;
L->next=k;
return L;
}

int main()
{ int n=6;
   int a=3;
 linklist list;
 list=creatlist(n);
 PrintNode(list);
 insertnode(a,list);
 PrintNode(list);
 system("pause");
 return 0;
}