Recall PQ Sorting We use a priority queue Insert the elements with a series of insert operations Remove the elements in sorted order with a series of removeMin operations The running time depends on the priority queue implementation: Unsorted sequence gives selection-sort: O(n2) time Sorted sequence gives insertion-sort: O(n2) time Can we do better?
Heaps A heap is a binary tree storing The last node of a heap keys at its nodes and satisfying is the rightmost node of the following properties: maximum depth Heap-Order: for every internal node v other than the root, 2 key(v) key(parent(v)) Complete Binary Tree: let h be 5 6 the height of the heap for i = 0, … , h - 1, there are 2i 9 7 nodes of depth i at depth h - 1, the internal nodes are to the left of the external nodes last node
Height of a Heap Theorem: A heap storing n keys has height O(log n) Proof: (we apply the complete binary tree property) Let h be the height of a heap storing n keys Since there are 2i keys at depth i = 0, … , h - 1 and at least one key at depth h, we have n 1 + 2 + 4 + … + 2h-1 + 1 Thus, n 2h , i.e., h log n
Heaps and Priority Queues We can use a heap to implement a priority queue We store a (key, element) item at each internal node We keep track of the position of the last node
Array-based Heap Implementation We can represent a heap with n keys by means of an array of 2 length n 5 6 For the node at rank i the left child is at rank 2i 9 7 the right child is at rank 2i + 1 Links between nodes are not explicitly stored Operation add corresponds to inserting at rank n + 1 2 5 6 9 7 Operation remove_min corresponds to removing at rank n 1 2 3 4 5 Yields in-place heap-sort
Insertion into a Heap Method insertItem of 2 the priority queue ADT 5 6 corresponds to the z 9 7 insertion of a key k to the heap insertion node The insertion algorithm consists of three steps 2 Find the insertion node z 5 6 (the new last node) z Store k at z 9 7 1 Restore the heap-order property (discussed next)
Upheap After the insertion of a new key k, the heap-order property may be violated Algorithm upheap restores the heap-order property by swapping k along an upward path from the insertion node Upheap terminates when the key k reaches the root or a node whose parent has a key smaller than or equal to k Since a heap has height O(log n), upheap runs in O(log n) time
Removal from a Heap Method removeMin of 2 the priority queue ADT 5 6 corresponds to the w removal of the root key 9 7 from the heap last node The removal algorithm consists of three steps 7 Replace the root key with the key of the last node w 5 6 w Remove w 9 Restore the heap-order property (discussed next) new last node
Downheap After replacing the root key with the key k of the last node, the heap-order property may be violated Algorithm downheap restores the heap-order property by swapping key k along a downward path from the root Upheap terminates when key k reaches a leaf or a node whose children have keys greater than or equal to k Since a heap has height O(log n), downheap runs in O(log n) time
Performance of a Heap A heap has the following performance for the priority queue operations.
The above analysis is based on the following facts:
The height of heap T is O(log n), since T is complete. In the worst case, up-heap and down-heap bubbling take time proportional to the height of T. Finding the insertion position in the execution of insert and updating the last node position in the execution of removeMin takes constant time. The heap T has n internal nodes, each storing a reference to a key and a reference to an element.
Bottom-up Heap Construction We can construct a heap storing n given keys in using a bottom-up 2i -1 2i -1 construction with log n phases In phase i, pairs of heaps with 2i -1 keys are merged into heaps with 2i+1-1 keys 2i+1-1
Analysis We visualize the worst-case time of a downheap with a proxy path that goes first right and then repeatedly goes left until the bottom of the heap (this path may differ from the actual downheap path) Since each node is traversed by at most two proxy paths, the total number of nodes of the proxy paths is O(n) Thus, bottom-up heap construction runs in O(n) time Bottom-up heap construction is faster than n successive insertions and speeds up the first phase of heap-sort, which takes O(n log n) time in its second phase.
