Frage im Vorstellungsgespräch bei Bloomberg

Given a singly linked list, write a function to pop a node in less than O(n) without using extra memory given this interface: void pop(Node * node);