Straightforward Implementations of Priority Queues

Priority queues are queues, and ordinary queues are linear.

Recall that Java's Deque (double-ended queue) type is implemented by the LinkedList class.

So two straightforward implementations of priority queues make use of linear structures: