What is the time complexity for deleting root key in a ternary heap of – McqOptions

MCQOPTIONS

1.	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)
C.	O (n)
D.	O (1)
Answer» C. O (n)

Discussion

No Comment Found

Related MCQs

An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
If we implement heap as maximum heap , adding a new node of value 15 to the left most node of right subtree. What value will be at leaf nodes of the right subtree of the heap.
If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
The worst case complexity of deleting any arbitrary node value element from heap is __________
Out of the following given options, which is the fastest algorithm?
How is a pairing heap represented?
What is the fundamental operation performed in skew heaps?
Is decrease priority operation performed more quickly in a ternary heap with respect to the binary heap.
What is the reason for the efficiency of a pairing heap?
What is the efficiency of merge used in leftist heaps?