You are viewing a single comment's thread. Return to all comments →
// Write your code here DoublyLinkedListNode curr = llist; DoublyLinkedListNode prev = null; DoublyLinkedListNode next = null; while(curr != null) { next = curr.next; curr.next = prev; prev = curr; curr = next; } return prev; }
Seems like cookies are disabled on this browser, please enable them to open this website
Reverse a doubly linked list
You are viewing a single comment's thread. Return to all comments →