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