Assertion: priority queue | /r/HasProperty | heap
Facets:
value: regardless of
type: OTHER
value: often
type: TEMPORAL
Source sentences:
text: The heap is one maximally efficient implementation of an abstract data type called a priority queue, and in fact, priority queues are often referred to as "heaps", regardless of how they may be implemented.