HW6 - p.212 6.4 Write the routines to do a...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Sheet1 Page 1 p.212 6.2 a. Show the result of inserting 10, 12, 1, 14, 6, 5, 8, 15, 3, 9, 7, 4, 11, 13, and 2, one at a time, into an initially empty binary he a b. Show the result of using the linear-time algorithm to build a binary heap using the same input. p.212 6.3 Show the result of performing three DeleteMin operations in the heap of the previous exercise.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: p.212 6.4 Write the routines to do a "percolate up" and a "percolate down" in a binary heap. p.213 6.13 If a d-heap is stored as an array, for an entry located in position i, where are the parents and children?...
View Full Document

This note was uploaded on 02/16/2011 for the course CS 136 taught by Professor Yuechen during the Winter '08 term at Zhejiang University.

Ask a homework question - tutors are online