队列的链式存储结构

队列是一种先进先出（FIFO）的数据结构，链式存储结构通过链表来实现队列。以下是一个使用Java实现的队列链式存储结构的示例代码： ```java class Node { int data; Node next; public Node(int data) { this.data = data; this.next = null; } } public class Queue { private Node front; private Node rear; public Queue() { this.front = null; this.rear = null; } // 入队操作 public void enqueue(int data) { Node newNode = new Node(data); if (rear == null) { front = rear = newNode; return; } rear.next = newNode; rear = newNode; } // 出队操作 public int dequeue() { if (front == null) { throw new NoSuchElementException("Queue is empty"); } int data = front.data; front = front.next; if (front == null) { rear = null; } return data; } // 查看队头元素 public int peek() { if (front == null) { throw new NoSuchElementException("Queue is empty"); } return front.data; } // 判断队列是否为空 public boolean isEmpty() { return front == null; } // 打印队列元素 public void printQueue() { if (front == null) { System.out.println("Queue is empty"); return; } Node current = front; while (current != null) { System.out.print(current.data + " "); current = current.next; } System.out.println(); } public static void main(String[] args) { Queue queue = new Queue(); queue.enqueue(10); queue.enqueue(20); queue.enqueue(30); queue.printQueue(); System.out.println("Dequeued: " + queue.dequeue()); System.out.println("Dequeued: " + queue.dequeue()); queue.printQueue(); System.out.println("Peek: " + queue.peek()); System.out.println("IsEmpty: " + queue.isEmpty()); } } ``` 这个示例代码定义了一个`Node`类来表示链表中的节点，并定义了一个`Queue`类来实现队列的基本操作，包括入队、出队、查看队头元素、判断队列是否为空以及打印队列元素。