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

  • jhakim101
     + 0 comments
    def reverse(llist):
    head = llist
    last = None    # hold onto last visited note
    while head:
		
        tmp = head.next
        head.next = head.prev
        head.prev = tmp
				
        last = head
        head = tmp
    return last