+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the space complexity of searching in a heap?

(a) O(logn)

(b) O(n)

(c) O(1)

(d) O(nlogn)

This interesting question is from Binary Heap topic in portion Heap of Data Structures & Algorithms I

I had been asked this question in an interview for internship.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
The correct choice is (b) O(n)

Easiest explanation - The space complexity of searching an element in heap is O (n). Heap consists of n elements and we need to compare every element. Here no addition or deletion of elements takes place. Hence space complexity is O (n).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.