| Heaps |
|
|
|
|
|
|
|
|
|
|
|
| • | Unlike
a binary search tree, the value of |
|||||||||
| each
node in a heap is greater than or |
||||||||||
| equal
to the value in each of its children. |
||||||||||
| • | In
addition, there is no relationship |
|||||||||
| between
the values of the children; you |
||||||||||
| don't
know which child contains the larger |
||||||||||
| value. |
||||||||||
| • | Heaps
are used to implement priority |
|||||||||
| queues. |
||||||||||