Building the Heap

1. For each value in the array 1..n do

2. Place the value into the “tree”

3. Bubble the value as high as it can go (push the largest values to highest position)

Previous slide

Next slide

Back to first slide

View graphic version