Question

What is the time complexity for decreasing priority of key in a maximum ternary heap of n elements?

(a) O (log n/ log 3)

(b) O (3log n/ log 3)

(c) O (n)

(d) O (1)

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

This question was posed to me in examination.

Answer 1

Correct choice is (b) O (3log n/ log 3)

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