The worst case complexity of deleting any arbitrary node value element – McqOptions

MCQOPTIONS

1.	The worst case complexity of deleting any arbitrary node value element from heap is __________
A.	O(logn)
B.	O(n)
C.	O(nlogn)
D.	O(n<sup>2</sup>)
Answer» B. 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
The worst case complexity of deleting any arbitrary node value element from heap is __________