Creating Heaps
Creating Heaps. Heap is an array-based implementation of a binary tree used for implementing priority queues, supports: insert, findmin, deletemin: complexities? Using array minimizes storage (no explicit pointers), faster too --- children are located by index/position in array
88 views • 7 slides