Linux 使用尾插法实现 链表A每个节点存放一个新的链表B1B2,B3,B4,B5的头结点。场景：一个年级相当链表A该年级5个班，每个班5个人，做学生管理系统源代码

#include <stdio.h>
#include <stdlib.h>

struct Student
{
	int yuwen;
	int shuxue;
	int yingyu;
	int ban;
	int ji;
	int zf;
	struct Student *next;
};

struct Class
{
	struct Student *xnext;
	struct Class *next;
};

void wellcome()
{
	printf("*************************************************************\n");
	printf("*************************************************************\n");
	printf("*************************************************************\n");
	printf("**********wellcome to the Student Management System**********\n");
	printf("*************************************************************\n");
    printf("*************************************************************\n");
    printf("*************************************************************\n");
}

struct Class *bjsf(struct Class *head,struct Class *new)
{
	struct Class *p=head;
	if(p == NULL){
		head=new;