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

  • vadym_usatiuk
     + 0 comments

    Java 15 O(n)

    public static DoublyLinkedListNode reverse(DoublyLinkedListNode llist) {
        DoublyLinkedListNode current = llist;
        DoublyLinkedListNode prev = null;

        while (current != null) {
            DoublyLinkedListNode nextNode = current.next;
            current.next = prev;
            current.prev = nextNode; // swap prev and next pointers
            prev = current;
            current = nextNode;
        }

        //prev points to the new head of the reversed list
        return prev;
    }