What is min-heap? Explain O(log n) time algorithm for inserting an element, extracting minimum element from a min-heap with n elements. Using the above operations give O(n log n) time algorithm to sort an array of n numbers. ( you are only allowed to use O(1) extra space). Can you build a min-heap of n elements in O(n) time? If yes give brief analysis supporting your claim.

Answer rating: 100% (QA)

What is minheap A Binary Heap is a Binary Tree with following properties 1 Its a complete tree All levels are completely filled except possibly the la... View the full answer