1 votes 1 votes We have a binary heap on $n$ elements and wish to insert $n$ more elements (not necessarily one after another) into this heap. Total time required for this is $\Theta (\log n)$ $\Theta (n)$ $\Theta (n \log n)$ $\Theta (n^{2})$ DS nielit2016mar-scientistc data-structures binary-heap + – admin asked Apr 2, 2020 • recategorized Oct 28, 2020 by Krithiga2101 admin 712 views answer comment Share Follow See 1 comment See all 1 1 comment reply vg653 commented Apr 2, 2020 reply Follow Share B is the correct option. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Option B we can use build heap method which will take O(n) time complexity https://gateoverflow.in/459/gate2008-47 Mohit Kumar 6 answered May 3, 2020 Mohit Kumar 6 comment Share Follow See all 0 reply Please log in or register to add a comment.