Assertion: deletion | /r/CapableOf | take logarithmic time
Facets:
value: in a binary heap
type: LOCATION
Source sentences:
text: This way, insertion and deletion both take logarithmic time, just as they do in a binary heap, but unlike a binary heap and most other priority queue implementations, a single tree can support all of find-min, find-max, delete-min and delete-max at the same time, making binary search trees suitable as double-ended priority queues.:156