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. Reverse a doubly linked list
  2. Discussions

Reverse a doubly linked list

  • ashurovabdulla24
     + 0 comments

    Solution in C++:

    DoublyLinkedListNode* reverse(DoublyLinkedListNode* llist) {
    if (llist == nullptr) {
        return llist;
    }
    
    std::swap(llist->next, llist->prev);
    while (llist->prev != nullptr) {
        llist = llist->prev;
        std::swap(llist->next, llist->prev);
    }
    
    return llist;
}