Assertion: priority queue | /r/HasProperty | implemented with heap
Facets:
value: often
type: TEMPORAL
Source sentences:
text: A priority queue is a concept like "a list" or "a map"; just as a list can be implemented with a linked list or an array, a priority queue can be implemented with a heap or a variety of other methods such as an unordered array.
text: A priority queue is an abstract concept like "a list" or "a map"; just as a list can be implemented with a linked list or an array, a priority queue can be implemented with a heap or a variety of other methods.
text: While priority queues are often implemented with heaps, they are conceptually distinct from heaps.