1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:
20:
|
public class Queue<T> {
private Node<T> first, last;
public void add(T item) {
Node<T> newNode = new Node<T>(item);
if (first == null) {
first = newNode;
last = first;
} else {
last.next = newNode;
}
}
public T pop() {
Node<T> result = first;
if (first != null)
first = first.next;
return result.getItem();
}
} |