A PriorityQueue is a list that always keeps its items sorted based on some rule, like smallest to largest. So, when you take an item out, you always get the one with the highest (or lowest) priority.

All of the data structures we’ll look at in this series are aggregates. Containers. Anything from which data items are stored and retrieved could be considered a data structure.

Data comes in many shapes and forms (obviously), but two of its core ‘structures’ are stacks and queues. Data elements in a stack and a queue differ by virtue of their order.

Correctly use and manipulate pointer variables to change variables and build dynamic data structures. Determine an appropriate data structure for given problems. Follow, explain, trace, and be able to ...

Covers algorithms and their performance analysis, data structures, abstraction, and encapsulation. Introduces stacks, queues, linked lists, trees, heaps, priority queues, and hash tables, and their ...