In Java, why is insertion or deletion in a Linked List a constant time operation? Isn't it misleading?

Question

Insertion or deletion of an element at a specific point of a list, assuming that we have a pointer to the node already, is a constant-time operation. - from

Answer 1

You said it yourself: "assuming we have a pointer to the node already". That avoids the traversal you identify as the cause of the linear time.

Admittedly, the Wikipedia text is a bit ambiguous, since there are two nodes involved: the one being inserted, and the one in the list where to insert it.