HomeData Modelling & AIData Structures | Heap | Question 7

Data Structures | Heap | Question 7

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) theta(logn) (B) theta(n) (C) theta(nlogn) (D) theta(n^2)

(A)

A

(B)

B

(C)

C

(D)

D

Answer: (B)
Explanation:

We can reduce the problem to build heap for 2n elements. Time taken for build heap is O(n).

Hence (B) is the correct answer.

Quiz of this Question
Please comment below if you find anything wrong in the above post

Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!

RELATED ARTICLES

Most Popular

Dominic
32737 POSTS0 COMMENTS
Milvus
131 POSTS0 COMMENTS
Nango Kala
7119 POSTS0 COMMENTS
Nicole Veronica
12251 POSTS0 COMMENTS
Nokonwaba Nkukhwana
12334 POSTS0 COMMENTS
Shaida Kate Naidoo
7228 POSTS0 COMMENTS
Ted Musemwa
7490 POSTS0 COMMENTS
Thapelo Manthata
7208 POSTS0 COMMENTS
Umr Jansen
7180 POSTS0 COMMENTS