+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the time complexity for increasing priority of key in a maximum ternary heap of n elements?

(a) O (log n/ log 3)

(b) O (n!)

(c) O (n)

(d) O (1)

This key question is from Ternary heap topic in chapter Heap of Data Structures & Algorithms I

I got this question during an interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct choice is (a) O (log n/ log 3)

The explanation is: In order to increase the priority of an item in a ternary heap data structure having n elements, it performs upwards swapping. So the time complexity for worst case is found to be O (log n/ log 3).

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

...