
FREE C PROGRAMSData Structures and C Programming 
DATA STRUCTURES USING C 
Data Structures Interview Questions
Pg : 1 , 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 Heaps
Two basic maintenance operations are performed on a heap.
Useful Link: www.sortingalgorithms.com/heapsort A heap is a data structure used to implement an efficient priority queue. The idea is to make it efficient to extract the element with the highest priority the next item in the queue to be processed. We could use a sorted linked list, with O(1) operations to remove the highest priority node and O(N) to insert a node. Using a tree structure will involve both operations being O(log2N) which is faster. HEAP SORT C PROGRAMhttp://www.freecprograms.com/heapsort.htm  
