We have a binary heap on n elements and wish to insert n more elements (not…
GATE · 2008 · CS
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
- A.
θ(logn)
- B.
θ(n)
- C.
θ(nlogn)
- D.
θ(n2)
Attempted by 797 students.
Show answer
Correct answer: B
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…