Question entretien chez 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);

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);

Utilisateur anonyme

17 mars 2018

I still doubt the validity of this question...