binary heap huwa siġra binarja kompleta maħżuna f'array li tippreserva l-heap property: f'min-heap, kull parent huwa ≤ it-tfal tiegħu, għalhekk il-minimu huwa dejjem mal-għerq. Dan jagħmel implimentazzjoni standard ta' 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
heapq
h = []
heapq.heappush(h, )
heapq.heappush(h, )
heapq.heappush(h, )
smallest = h[]
heapq.heappop(h)
