Interview Questions

Reverse a linked list with O(1) memory, and O(n) time

Microsoft Interview Questions and Answers


(Continued from previous question...)

272. Reverse a linked list with O(1) memory, and O(n) time

Question:
Reverse a linked list with O(1) memory, and O(n) time


maybe an answer:


void reverse(Node **header)
{
if(header)
{
Node *newheader=*header;
Node *current=(*header)->next;

while(current)
{
Node *newCurrent=current->ext;
current->next=newheader;
newheader=current;
current=newcurrent;
}

*header=newheader;
}
}

(Continued on next question...)

Other Interview Questions