Data Structures | Heap | Question 7
We have a binary heap on n elements and wish to insert n more elements (not necessarily one after another) into this heap. The total time required for this is
Explanation: We can reduce the problem to Build Heap for 2n elements. Time taken for build heap is O(n)
Quiz of this Question
My Personal Notes arrow_drop_up
Please Login to comment...