Elementary data structures. Explain how to use a priority queue to implement the stack, qu...

Elementary data structures. Explain how to use a priority queue to implement the stack, queue, and randomized queue data types from section and exercise.

Exercise

Random queue. A random queue stores a collection of items and supports the following API:

Write a class RandomQueue that implements this API. Hint : Use an array representation (with resizing). To remove an item, swap one at a random position (indexed 0 through N-1) with the one at the last position (index N-1). Then delete and return the last object, as in ResizingArrayStack. Write a client that deals bridge hands (13 cards each) using RandomQueue.