This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS 234 Fall 2010 Assignment 3 Written Component Solutions This assignment is meant to give you further insight into heaps and sorting. 1. Carefully explain why remove_max from a heap is Θ(1) in the bestcase. Be sure to consider arbitrarily large heaps. [3 marks] The time needed to access the last node and move it to the root is Θ(1) . Each bubble down operation is Θ(1) . We show that it is possible for there to be exactly one bubble down operation. (Note there must be at least one bubble down operation because the child of the root in the same subtree as the last node will be out of heaporder with the last node after it moves to the root.) Here is a situation in which there is exactly one bubbledown operation: • the last node is in the left subtree • the item with the second highest priority is in the right child of the root • all priorities of items in the left subtree are larger than priorities in the proper descen dants of the right child of the root In this case, the heaporder property will be satisfied after the last node is moved to the root and swapped with its right child. The case where the last node is in the right subtree is similar. 2. (a) If a heap is of size n , exactly how many indices in the array (Python list) might contain the item with the second largest priority? Explain briefly. [2 marks] The item of second largest priority must be stored in one of the root’s children. The item in the root must be of higher priority and all items in proper descendants must be...
View
Full
Document
This note was uploaded on 01/27/2011 for the course CS 234 taught by Professor Baranoski during the Fall '09 term at Waterloo.
 Fall '09
 BARANOSKI
 Sort

Click to edit the document details