Priority Queues and Heaps

Percursor to Heaps: Priority Queues

Practice with Priority Queues Using Practice-It

Do the following problems involving PQs using Practice-It:

1.  BJP5 Exercise 18.8: descending

2.  BJP5 Exercise 18.9: kthSmallest

3.  BJP5 Exercise 18.10: isConsecutive

4.  BJP5 Exercise 18.11: removeDuplicates

Introduction to Binary Heaps

Two Ways to Build a Heap from an Array (Williams Method and BuildHeap)

The Williams method (shown on the left video) uses a repeated insertion technique and is O(n*logn). The Build Max Heap method (shown on the right) runs in linear time O(n).

Huffman Coding 

Huffman Coding Assignment

Click on this link to view your Huffman Coding assignment. After clicking on the link, download the folder named "Jabberwocky Project" on to your computer. This project involves the use of a Priority Queue to encode messages efficiently.