Min-max heap
id:
min-max-heap-277-6693819
title:
Min-max heap
text:
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. This makes the min-max heap a very useful data structure to implement a double-ended priority queue. Like binary min-heaps and max-heaps, min-max heaps support logarithmic insertion and deletion and can be built in linear time. Min-max
brand slug:
wiki
category slug:
encyclopedia
description:
Computer data structure
original url:
https://en.wikipedia.org/wiki/Min-max_heap
date created:
date modified:
2024-04-11T17:37:22Z
main entity:
{"identifier":"Q1936133","url":"https://www.wikidata.org/entity/Q1936133"}
image:
fields total:
13
integrity:
14