Linked List Gists: (1) reverse a linked list

reverse.cpp

/*
 Credit to Leetcode: http://leetcode.com/2010/04/reversing-linked-list-iteratively-and.html
 */
 
struct Node {
  int val;
  Node *next;
  Node(int value):val(value), next(NULL) {};
};

Node* reverse(Node* head) {
    
  Node *curr = head;
  Node *prev = NULL;
  
  while (curr) {
    Node *next = curr->next;
    curr->next = prev;
    prev = curr;
    curr = next;
  }
  
  return prev;
}

void reverseRecursive(Node*& p) {
  if (p == NULL)
   return;
   
  Node *rest = p->next;
  if (rest == NULL)
   reutrn;
  
  reverseRecursive(rest);
  
  p->next->next = p;
  p->next = NULL;
  p = rest;
}