An ArrayDeque is a resizable-array that supports element insertion and removal at both ends.
Null elements are prohibited.
The name deque is short for "double ended queue".
The BitSet class implements a bit array. Each element is either true or false.
A BitSet is created with a given size and grows automatically if this size is exceeded.
A PriorityQueue holds elements on a priority heap, which orders the elements according to their natural order or according to a specified comparator.
Only elements that are comparable are permitted to be inserted into the queue.
A SparseArray maps integers to objects.
All keys are sorted in ascending order. Duplicate keys are not allowed.
A SparseArray is intended to be more memory efficient than a Map.
A stack is a Last-In/First-Out(LIFO) data structure which represents a stack of objects.
Beware: the top of the stack is the last added element.
A TreeMap is a map whose entries are sorted by their keys.
All keys of this map must be mutually comparable. Duplicate keys are not allowed.
A TreeSet is a set which iterates over its elements in a sorted order.
All elements in this set must be mutually comparable. Duplicates are not allowed.