-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinkedQueue.java
More file actions
83 lines (64 loc) · 1.27 KB
/
Copy pathLinkedQueue.java
File metadata and controls
83 lines (64 loc) · 1.27 KB
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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
package Lab3;
public class LinkedQueue <T> implements QueueInterface <T> {
private Node firstNode;
private Node lastNode;
//defines Nodes
private class Node {
T data;
Node next;
public Node(T data, Node nextNode) {
this.data = data;
next = nextNode;
}
public Node(T newData) {
this(newData, null);
}
public T getData() {
return data;
}
/*public void setData(T newData) {
data = newData;
}*/
public Node getNext() {
return next;
}
public void setNext(Node newNext) {
next = newNext;
}
}
public LinkedQueue() {
firstNode = null;
lastNode = null;
}
public void enqueue(T newEntry) {
Node newNode = new Node(newEntry);
if(isEmpty()) {
firstNode = newNode;
}
else {
lastNode.setNext(newNode);
}
lastNode = newNode;
}
public T dequeue() {
if(isEmpty()) {
throw new EmptyQueueException();
}
T front = firstNode.getData();
firstNode = firstNode.getNext();
if(firstNode == null) {
lastNode = null;
}
return front;
}
public T getFront() {
return null;
}
public boolean isEmpty() {
return firstNode == null;
}
public void clear() {
firstNode = null;
lastNode = null;
}
}