Q79
What is the time complexity for decreasing priority of key in a minimum ternary heap of n elements?
A.
O (log n/ log 3)
AnswerB.
O (n!)
C.
O (n)
D.
O (1)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board