Phase I: Forming a Heap
l
This is the actual Peter Principle.
l
Start with the data distributed randomly
in the tree.
l
Form Òsub-heapsÓ beginning at the leaves
and working toward the root.
l
Successively combine two sub-heaps with a
common root into a single heap.