If it is the Last node of the linked list it will take O(n) time. Despite node pointer is given but we don't know the address of the previous node. From head, we need to traverse the linked list to get the add of the previous node.
If we have address of prevoius node then only we can store the address of the next node that has to be deleted.
Previous -> next = Current -> next;