+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the complexity of adding an element to the heap.

(a) O(log n)

(b) O(h)

(c) O(log n) & O(h)

(d) O(n)

Asked question is from Heap topic in division Heap of Data Structures & Algorithms I

The question was posed to me during an interview.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
Right option is (c) O(log n) & O(h)

The best I can explain: The total possible operation in re locating the new location to a new element will be equal to height of the heap.

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.

Categories

...