How would you write the code to reverse a linked list?

Question

Anonymous · Accepted Answer

Node ptr = root;
Node temp = null;
Node prev = null;
while (ptr != null) {
  temp = ptr.next;
  ptr.next = prev;
  prev = ptr;
  ptr = temp;
}
ptr = prev;

Ankit · Answer

Recursive Solution

Node * reverse( Node * ptr , Node * previous)
{
    Node * temp;
    if(ptr->next == NULL) {
        ptr->next = previous;
        return ptr;
    } else {
        temp = reverse(ptr->next, ptr);
        ptr->next = previous;
        return temp;
    }
}
reversedHead = reverse(head, NULL);

eBay

eBay Interview Question

Interview Answers

Followed companies

Job searches

Bowls

Want the inside scoop on your own company?