Mar 24, 2004

**Name:**________________________________________

- (2 pt)
Draw two different binary min-heaps both of which contain
the same set of keys: {10, 7, 6, 4, 3, 1}.

- (1 pt)
Draw the result of removing the minimum element from
this binary heap, using the remove algorithm given in class:

- (1 pt)
Describe the heapsort algorithm.

- (1 pt) What is the worst-case asymptotic running time of heapsort for sorting n keys?