Binary heap
id:
binary-heap-172-143447
title:
Binary heap
text:
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues. The binary heap was introduced by J. W. J. Williams in 1964, as a data structure for heapsort. A binary heap is defined as a binary tree with two additional constraints:
- Shape property: a binary heap is a complete binary tree; that is, all levels of the tree, except possibly the last one (deepest) are fully filled, and, if the last level of the tree is n
brand slug:
wiki
category slug:
encyclopedia
description:
Variant of heap data structure
original url:
https://en.wikipedia.org/wiki/Binary_heap
date created:
2002-08-09T13:27:34Z
date modified:
2024-09-01T17:08:33Z
main entity:
{"identifier":"Q803847","url":"https://www.wikidata.org/entity/Q803847"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/3/38/Max-Heap.svg","width":500,"height":600}
fields total:
13
integrity:
16