| Heaps |
|
|
|
|
|
|
|
|
|
|
|
| • | Priority
Queue ADT operations can be |
|||||||||
| implemented
using heaps... |
||||||||||
| – | which
is a weaker binary tree but sufficient |
|||||||||
| for
the efficient performance of priority |
||||||||||
| queue
operations. |
||||||||||
| – | Let's
look at heap: |
|||||||||