Assertion: priority queue | /r/HasProperty | analogous
Facets:
value: to heap data structure
type: OTHER
Source sentences:
text: Priority queue is analogous to heap data structure where element can be inserted in any order and always max heap element is retrieved first.