to J, good stuff. remember to return newHead

Node* reverseList(Node *n1, Node *n2) { Node *newHead; if (n2->next != NULL) newHead = reverseList(n2, n2->next); else newHead = n2; n2->next = n1; n1->next = NULL; return newHead; }