CS261 Homework Name: ____________________________________
due 6/4 4PM
1. What are the 2 data structures usually used to implement a priority queue?
A.
B.
2. What is the underlying structure of ‘A’?
3. What is the underlying structure of ‘B’?
4. Are the algorithms for insertion and deletion the same for ‘A’ and ‘B’? Why or why not?
5. Is it common to search a priority queue for a specific value?
6. Is an enumeration of a priority queue in order?
7. Why don’t we just use a SortedVector or an AVLTree for a priority queue? Be brief, but complete.
