Unformatted text preview: 2. Problem 6.2 on page 251252. For part a, draw the resulting heap after each insertion. 3. Problem 6.3 on page 252. DeleteMin is the same as ExtractMin in the lectures. Draw the resulting heap after each deletion. 4. Problem 6.7 on page 253, part a and b. 5. Problem 6.8 on page 253. Show your proof....
View
Full
Document
This note was uploaded on 07/25/2008 for the course CSE 331 taught by Professor M.mccullen during the Spring '08 term at Michigan State University.
 Spring '08
 M.McCullen
 Algorithms, Data Structures

Click to edit the document details