The Queue Implementations With Linked List 

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

 

posted @ 2017-09-14 17:49  StringBuilder  阅读(62)  评论(0)    收藏  举报