-
Notifications
You must be signed in to change notification settings - Fork 2
/
QueueLL.java
68 lines (57 loc) · 1.21 KB
/
QueueLL.java
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
public class QueueLL<T> implements Queue<T> {
private LinkedList<T> myData;
public QueueLL() {
myData = new LinkedList<T>();
}
/**
* Tests if the queue is empty.
*
* @return true iff the queue is empty
**/
public boolean isEmpty() {
// return the method is empty from linked list
return myData.isEmpty();
}
/**
* Gets the element at the front of the queue without removing it.
*
* @return the peeked data
**/
public T peek() {
// only return the first element without removing it
return myData.getFirst();
}
/**
* Removes the front element of the queue and returns it.
*
* @return the dequeued data
**/
public T dequeue() {
//put my first data in a temp value
T tempData = myData.getFirst();
//then delete it
myData.deleteFirst();
//and then return it
return tempData;
}
/**
* Adds an element to the end of the queue.
**/
public void enqueue(T data) {
if (!myData.isEmpty()){
myData.insertLast(data);
}
else {
myData.insertFirst(data);
}
}
/**
* Returns a String representation of the queue.
*
* @return queue as String
**/
public String toString() {
// calls the method toString from linked list
return myData.toString();
}
}