数据结构 链表的相关算法的用C++语言实现

#include <iostream>
using namespace std;
#define NULL 0     
struct student
{long num;
 float score;
 student *next;
};    
int n; 

int main()
{ student *creat(void);
  student *del(student *,long);  
  student *insert(student *,student *);
  void print(student *);
  student *head,*stu;
  long del_num;
  cout<<"input records:"<<endl;
  head=creat();                        //返回头指针
  print(head);                          //输出全部结点
  cout<<endl<<"input the deleted number:";
  cin>>del_num;                        //输入要删除的学号
  while(del_num!=0)
  {head=del(head,del_num);              //删除后链表的头地址
   print(head);                         //输出全部结点
   cout<<"input the deleted number:";
   cin>>del_num; 
  }
  cout<<endl<<"input the inserted record:";  //输入要插入的结点
  stu=new student;                      //开辟一个新结点