Domanda di colloquio di S&P Global
algorithm to reverse a singly linkedlist. (most efficient way)
Risposta di colloquio
Anonimo
18 feb 2010
running in O(n). using iterator to rearrange the nodes.
algorithm to reverse a singly linkedlist. (most efficient way)
Anonimo
running in O(n). using iterator to rearrange the nodes.