Assertion: priority queue | /r/CapableOf | use heap
Facets:
value: as their backbone
type: MANNER
value: typically
type: DEGREE
Source sentences:
text: To improve performance, priority queues typically use a heap as their backbone, giving O(log n) performance for inserts and removals, and O(n) to build initially from a set of n elements.