C++ 链表操作

#include <iostream.h>

struct student
{
int num;
int score;
struct student *next;
};

int n;

struct student *CreateLink()
{
struct student *head;
struct student *p1=NULL;
struct student *p2=NULL;
int num = 1;
int score = 11;
n = 0;
p1 = new struct student();
p2 = p1;
if (p1 == NULL)
{
cout<<"/nCann't create it, try it again in a moment!/n";
return NULL;
}
else
{
head = NULL;
p1->num = num++;
p1->score = score++;
}

while(p1->num < 10)
{
n += 1;
if (n==1)
{
head = p1;
p2->next = NULL;
}
else
{
p2->next = p1;
}
p2 = p1;
p1 = new struct student();
p1->num = num++;
p1->score = score++;
}
p2->next = NULL;
delete(p1);
p1 = NULL;
return head;
}

void Print(struct student *head)
{
struct student *p;
p = head;
if(head != NULL)
{

do
{
cout<num<<'/t'<score<<'/t'<next<