Heap: container or range?

[Bill Baxter]

On Fri, Jan 30, 2009 at 4:01 PM, Yigal Chripun <yigal100 at gmail.com> wrote:
>
> regarding your previous question:
> isn't a Heap also called a Priority Queue?
>

I the distinction is that a Heap is one way to implement a Priority
Queue.  You could implement a priority queue by scanning a linked list
for the smallest item and it would still be a (really inefficient)
Priority Queue.

--bb