基础数据结构：队列

public class Queue {
    private Node front;
    private Node rear;

    public  Queue(){
        this.front = this.rear = null;
    }

    public void inQueue(String data){
        Node n = new Node(data);
        if(isEmpty()){
            front = rear = n;
        }else {
            rear.setNext(n);
            rear = n;
        }
    }

    public void outQueue() {
        if(isEmpty()){
            System.out.println("队列中没有元素。");
        }else {
            Node tmp = front;
            front = tmp.getNext();
            tmp.setNext(null);
        }
    }

    public boolean isEmpty(){
        return front == null && rear == null;
    }

    @Override
    public String toString(){
        if (isEmpty()){
            return null;
        }else {
            return front.toString();
        }
    }
}

其中节点类与链表的节点类相同。