Include your answers to all questions in one file, Quiz11.txt, and submit that file via email by end of class.  Good luck.

Question 1

Very briefly explain why we created a special Tree class for our PriorityQueue which did not delete its children when they were set to new values, but did delete them if they existed at the time the entire Tree was deleted.

Question 2

Explain how you might change your priority queue implementation if you knew that there were at most, say, 20 different priority levels.

Question 3

Using the the code in PriorityQueueQuiz.zip, write the PriorityQueue::dequeue function.  Submit only the code to this function, not the entire program.