Binary Heap Operations Worst-case Analysis log2 Height of heap is N insert: O(log2N) 2.607 comparisons on average, i.e., O(1) deleteMin: O(log2N) decreaseKey: O(log2N) increaseKey: O(log2N) remove: O(log2N) buildHeap: O(N) 27
Binary Heap Operations Worst-case Analysis Height of heap is log2 N insert: O(log2N) 2.607 comparisons on average, i.e., O(1) deleteMin: O(log2N) decreaseKey: O(log2N) increaseKey: O(log2N) remove: O(log2N) buildHeap: O(N) 27
ADS-AUK-UNIT-3.docx