The GATE Grind

GATE 2008 CS – Question 47

Programming and Data Structures · Binary Heaps · 2 marks · Multiple choice

A binary heap has n elements; insert n more, not necessarily one at a time. What total time is required?

  1. $\Theta(\log n)$
  2. $\Theta(n)$
  3. $\Theta(n\log n)$
  4. $\Theta(n^2)$

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (B) $\Theta(n)$

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Binary Heaps questions

All Binary Heaps questions →