CSE 247 Module 3: Priority Queues

Lab


Abstract: We have studied the Binary Heap data structure in class. Now it is your turn to implement one. In support of both sorting and the next programming assignment, we will implement a minimum priority queue, so that elements are extracted from smallest to largest.

Goals of this lab:


Introduction


Your work for this lab


Having trouble?

Post problems on piazza, but do not post code publicly there!

Submitting your work (read carefully)



Last modified 14:54:19 CDT 31 October 2016