A binary heap shine cikakken bishiyar zwarinwar gida wajen ajiye shi a cikin array wanda ke kiyaye heap property: a cikin min-heap, kowane iyaye ≤ yaye, saboda haka mafi ƙarami koyaushe akwai asusun. Wannan shine aiwatar da 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
