Java实现队列-链表

package Queue;
import java.io.*;
class QueueNode{
	int data;
	QueueNode next;
	public QueueNode(int data) {
		this.data=data;
		this.next=null;
	}
}
class Linked_List_Queue{
	public QueueNode front;
	public QueueNode rear;
	public Linked_List_Queue() {front=null;rear=null;}
	public boolean enqueue(int value) {
		QueueNode node=new QueueNode(value);
		if(rear==null) {
			front=node;
			
		}else {
			rear.next=node;
		}
		rear=node;
		return true;
	}
	public int dequeue() {
		int value;
		if(!(front==null)) {
			if(front==rear)rear=null;
			value=front.data;
			front=front.next;
			return value;
		}
		else return -1;
	}
}
public class QueueByLink {
	public static void main(String args[]) throws IOException{
		Linked_List_Queue queue=new Linked_List_Queue();
		int temp;
		System.out.println("用链表实现队列");
		int j=1;
		for(int i=1;i<10;i+=2) {
			System.out.println("在队列前端加入第"+j+"个数据，此数据为"+i);
			queue.enqueue(i);
			j++;
		}
		while(true) {
			if(!(queue.front==null)) {
				temp=queue.dequeue();
				System.out.println("从队列前端按序取出的数据值为："+temp);
			}else
				break;
		}
		System.out.println();
		
	}
}