You are viewing a single comment's thread. Return to all comments →
def reverse(llist): reverse, stack, current = SinglyLinkedList(), [], llist while current: stack.append(current.data) current = current.next while stack: reverse.insert_node(stack.pop()) return reverse.head
Seems like cookies are disabled on this browser, please enable them to open this website
Reverse a linked list
You are viewing a single comment's thread. Return to all comments →