Q57
What is the time complexity for deleting root key in a ternary heap of n elements?
A.
O (log n/ log 3)
B.
O (3log n/ log 3)
AnswerC.
O (n)
D.
O (1)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board