Week 08 Priority Queues, Heaps, and Graphs

This week we will consider how additional branching structures are defined and implemented to support a variety of applications. In particular, we will investigate priority queues that allow access to elements that have the highest priority, heaps which are an implementation of priority queues that use a binary tree to enforce shape and order, and graphs which allow us to represent useful relationships that are not hierarchical.