Solution: d-Heaps
4
9
6
5
4
2
3
1
8
10
12
7
11
Each node has d children
Still representable by array
Good choices for d:
optimize performance based on # of inserts/removes
choose a power of two for efficiency
fit one set of children in a cache line
fit one set of children on a memory page/disk block
3
7
2
8
5
12
11
10
6
9
1
12
Previous slide
Next slide
Back to first slide
View graphic version