题目概述：
单向链表。
编程：
#include< iostream>
using namespace std;
typedef struct node
{
char name[20];
int age;
struct node* next;
}Student;
Student* createList(int n)
{
Student* head = new Student;//头节点
Student* pre = head;
for (int i = 0; i < n; i++)
{
Student* p = new Student;
cout << “输入学生姓名和年龄” << endl;
cin >> p->name;
cin >> p->age;
pre->next = p;
pre = p;
p->next = NULL;
}
return head;
}
void display(Student* head)
{
Student* p = head->next;
while (p != NULL)
{
cout << p->name << " ";
cout << p->age << endl;
p = p->next;
}
}
int main()
{
int n;
cout << “输入n个人” << endl;
cin >> n;
Student* head = createList(n);
display(head);
return 0;
}
上机实践：
