# What is the time complexity for increasing priority of key in a minimum ternary heap of n elements?

Category: QuestionsWhat is the time complexity for increasing priority of key in a minimum ternary heap of n elements?
Editor">Editor Staff asked 5 months ago

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

(a) O (log n/ log 3)

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

(c) O (n)

(d) O (1)

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

I had been asked this question by my school principal while I was bunking the class.

Editor">Editor Staff answered 5 months ago

The correct answer is (b) O (3log n/ log 3)

Explanation: In order to the increasing the priority of key in a minimum 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).

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40702