How would you print a linked list in reverse order?

Question

Jon · Accepted Answer

@blakdogg: The question is not about how to reverse the link list but to print it in reverse.

Here is my solution:

void reversePrint(Node* current) {
   if (current) {
      reversePrint(current->next);
      printf ("%s 
", current->data);
   }
}

Dude · Answer

Jon:  Your solution would crash on a large data set.  Too much stack space used.

The first solution was a hint at the overall solution which would be to use that function twice.  Once to reverse the list, then print, then reverse it back.

Anonymous · Answer

void printReverseLinkedList (Node node)
{
      if (node.next != null)
      {
            printReverseLinkedList(node.next);
      }

      System.out.println(node.data);
}

blakdogg · Answer

public Node reverseList(Node root) {
	Node rev = root;
	Node current;// = root;
	Node fwd = root.left;
	rev.left=null;
	while (fwd!=null) {
	    current = fwd;
	    fwd=current.left;
	    current.left=rev;
	    rev=current;
	}
	return rev;
    }

Bloomberg

Pergunta de entrevista da empresa Bloomberg

Respostas da entrevista

Empresas seguidas

Buscas de vagas