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)
Answer:A
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)