4import java.util.NoSuchElementException;
24 throw new NoSuchElementException();
32 throw new NoSuchElementException();
50 s+=i.
next().toString()+
"<";
T next()
return current entry and advance forward
Implementation of a doubly linked list.
Impementation of AbstractQueue based on doubly linked list DList.
T front()
Get front element of queue.
void enqueue(T x)
Enqueue element at end of queue.
T dequeue()
Remove front element from queue.
boolean is_empty()
Is queue empty?
Interface for an ADT queue.
AuD lecture: Data structures, algorithms, examples.