Fheapsex - Engineering Exercises 1 Assume that items a through m with keys 3 5 2 7 4 10 8 6 3 6 1 2 9 are inserted in alphabetical order into a p

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Engineering xercises 2. A printout from the Fibonacci heap driver program is shown Exercises 1. Assume that items a through m with keys 3, 5, 2, 7, 4, 10, 8, 6, 3, 6, 1, 2, 9 are inserted in alphabetical order into a below. Each set of values represents the (item number, key and rank). Mark bits that are set are shown as an asterisk. 5 1 0 7 2 2 3 6 1 12 19 0 ,,,,, p Fibonacci heap. Show the heap following the insertions. Then do a deletemin and show the resulting heap state. Data structure after insertions (single node trees linked in circular list 11 20 0 8 3 3 14 4 2* 2 4 1 4 9 0 1 5 0 key,rank Data structure after deletemin (including linking process). 15 8 1 6 10 0 10 5 1* 9 13 0 Which items are siblings of item 10? 14 and 15 What are the values of the four pointers associated with item a 3,0 d 7,0 c 2,0 b 5,0 m 9,0 l 2,0 . . . 2 3 p 3 (identify each of the pointers)? parent is 7, left sibling is 11, right sibling is 11 and child is 12. How many children did item 3 have when it first became a child of item 7? 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/03/2010 for the course CSE 541 taught by Professor Buhler during the Spring '09 term at Washington University in St. Louis.

Page1 / 2

Fheapsex - Engineering Exercises 1 Assume that items a through m with keys 3 5 2 7 4 10 8 6 3 6 1 2 9 are inserted in alphabetical order into a p

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online