Definitions from Wikipedia (Min-max heap)

▸ noun:  In computer science, a min-max heap is a complete binary tree data structure which combines the usefulness of both a min-heap and a max-heap, that is, it provides constant time retrieval and logarithmic time removal of both the minimum and maximum elements in it.


▸ Words similar to min-max heap
▸ Usage examples for min-max heap

▸ Idioms related to min-max heap
▸ Wikipedia articles (New!)
▸ Words that often appear near min-max heap
▸ Rhymes of min-max heap

▸ Invented words related to min-max heap