Java Data Structure queue

Description

Click the following links for the tutorial for Data Structure and queue.

1. Implements a Priority Queue unordered that iterates over the smallest key.
2. Implements a Priority Queue unordered that iterates over the largest key.
3. Implements a Priority Queue ordered that iterates over the smallest key.
4. Randomized Queue
5. Generic Queue Array Resize
6. Generic Queue
7. Non generic Dequeue
8. Generic min priority queue implementation with a binary heap



9. The Queue class represents a first-in-first-out (FIFO) queue of generic items.
10. Implements a priority queue using a max heap. The heap is of fixed size and represented using an array.