A binary heap minangka wit biner lengkap sing disimpen ing array sing njaga heap property: ing min-heap, saben parental kudu ≤ anak-anake, mula minimum tansah ana ing root. Iki nggawe dadi implementasi standar saka priority queue.
Array layout
text
1 index: 0 1 2 3 4
/ \ array: [1, 3, 5, 8, 4]
3 5 parent(i) = (i-1)//2
/ \ left(i) = 2i+1
8 4 right(i) = 2i+2
Operations
python
