| Heaps |
|
|
|
|
|
|
|
|
| • | A
priority queue is an Abstract Data Type! |
||||||
| • | Which,
can be implemented using heaps. |
||||||
| Think
of a To-Do lists; each item has a |
|||||||
| priority
value which reflects the urgency |
|||||||
| with
which each item needed to be |
|||||||
| addressed. |
|||||||