We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Linked Lists
  4. Reverse a doubly linked list
  5. Discussions

Reverse a doubly linked list

  • bhoeting
     + 5 comments

    Thought I'd share my recursive solution:

    Node* Reverse(Node* node)
{
  // If empty list, return
  if (!node) return NULL;
  
  // Otherwise, swap the next and prev
  Node *temp = node->next;
  node->next = node->prev;
  node->prev = temp;
  
  // If the prev is now NULL, the list
  // has been fully reversed
  if (!node->prev) return node;
  
  // Otherwise, keep going
  return Reverse(node->prev);
}