队列的链表实现

 1 public class QueueNode
 2 {
 3     public Object data;
 4     
 5     public QueueNode next;
 6 }
 7 
 8 public class LinkedQueue
 9 {
10     private QueueNode front;
11     
12     private QueueNode rear;
13     
14     public LinkedQueue()
15     {
16         QueueNode node = new QueueNode();
17         
18         front = node;
19         
20         rear = node;
21     }
22     
23     public boolean add(QueueNode data)
24     {
25         if(front == null)
26         {
27             front.next = data;
28             
29             rear = data;
30             
31             return true;
32         }
33         else
34         {
35             rear.next = data;
36             
37             rear = data;
38             
39             return true;
40         }
41     }
42     
43     public QueueNode get()
44     {
45         if(front == rear)
46         {
47             return null;
48         }
49         
50         QueueNode result = front.next;
51         
52         front = result;
53         
54         return result;
55     }
56 }