-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinkedQueue.java
More file actions
57 lines (51 loc) · 761 Bytes
/
Copy pathLinkedQueue.java
File metadata and controls
57 lines (51 loc) · 761 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
class LinkedQueue <Item> implements Queue <Item>
{
private Node front, rear;
private int size;
private class Node
{
Item item;
Node next;
}
public LinkedQueue()
{
front = null;
rear = null;
size = 0;
}
public boolean isEmpty()
{
return (size == 0);
}
public Item delete()
{
Item item = front.item;
front = front.next;
if (isEmpty())
{
rear = null;
}
size--;
return item;
}
public void insert(Item item)
{
Node oldRear = rear;
rear = new Node();
rear.item = item;
rear.next = null;
if (isEmpty())
{
front = rear;
}
else
{
oldRear.next = rear;
}
size++;
}
public int size()
{
return size;
}
}