We have a binary heap on n elements and wish to insert n more elements (not…
PYQ GATE 2008
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 1027 students.
Sign up free to check your answer
Sign up freeLoading lesson…

