Heapsort: Heaps II

• If there is a vertex with only one child, it must be a left child, and the child must be the rightmost vertex on the lowest level.

• For a given number of vertices, there is only one legal structure

Previous slide

Next slide

Back to first slide

View graphic version