A Queue
is used to define a LIFO (Last-In-First-Out) collection of data.
abstract class AbstractQueue {
size: number;
constructor(...items?: any[]);
enqueue(item: any);
enqueueAll(...items: any[]);
dequeue(): any;
peek(): any;
clear();
[Symbol.iterator]();
}