1.

What is the best case time complexity of deleting a node in a Singly Linked list?

A. O (n)
B. O (n<sup>2</sup>)
C. O (nlogn)
D. O (1)
Answer» E.


Discussion

No Comment Found