java链式队列实现学生管理系统

package 学生信息管理;

import java.util.Scanner;

class Queue {
   
	//链结点
	Student front;
	Student rear; 
//		public LQ() {}
}

public class Student {
   
	String name;
	int score;
	int xuehao;
	private Student next;
	private int size;
	
	//初始化操作
	public void init(Queue q){
   
		this.size = 0;
		q.front = q.rear = null;
	}
	
	//判队空
	public boolean isEmpty(Queue q) {
   
		if((q.front == q.rear)&&(size == 0)) {
   
			return true;
		}else {
   
			return false;
		}
	}
	
	//入队
	public void add(Queue q) {
   
		Scanner sc = new Scanner(System.in);
		Student stu = new Student();
		System.out.println("请输入该学生的信息：");
		System.out.print("姓名：");
		String name=sc.next();
		stu.name = name;
        System.out.print("成绩：");
		int score=sc.nextInt ();
		stu.score = score;
		System.out.print("学号：");
		int xuehao=sc.nextInt ();
		stu.xuehao = xuehao;
		if(isEmpty(q)) {
   
			q.front = stu;
			q.rear = stu;
			size++;
		}else {
   
			q.rear.next = stu;
			q.rear = stu;
			size++;
		}
	}
	
	//出队
	public void pop(Queue q) {
   
		if(isEmpty(q)) {
   
			System.out.println("队列为空！");
		}else {
   
			Student stu = q.front;
			q.front = stu.next;
			size--;
			System.out.println("出队成功！");
		}
	}
	
	//插入
	public void insert(Queue q) {
   
		System