Let us say assume ,question it means node with data X: Now we first need to search node with data X in O(n) and then delete.
Let us assume that by X ,it means Node with address X,but the 0(1) method does not delete node with address X.It just modifies node with address X and delete some of its neighbor.
I will go with $ O(n) $ with the above reasoning.