Gate CS-2008 Question Paper With Solutions

Q. 11 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

Answer: (B)

Explanation: