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
 Spring '08
 M.McCullen
 Algorithms, Data Structures, leaf nodes

Click to edit the document details