Time complexity of deletion in a linked list

Question

I\'m having a bit of trouble understanding why time complexity of link lists are O(1) according to this website. From what I understand if you want to delete an element surely y

Answer 1

Your are correct.

Deletion:

1.If pointer is given in this case Time Complexity is O(1).

2.You DON'T have pointer to the node to be deleted(Search and Delete). In this case Time Complexity is O(n).