def getReversedList(head_in): list_new = LinkedList() curr = head_in while curr: list_new.insert(curr.val, 0) curr = curr.next return list_new.getHeadNode()
## Tests For Singly Linked List Implementation from myllist import LinkedList list1 = LinkedList() print "Size is: " + str(list1.size()) list1.append(1) list1.append(2) list1.append(3) print "Size is: " + str(list1.size()) for idx in range(list1.size()): print list1.get(idx) list1.insert(4, 3) print "Size is: " + str(list1.size()) for idx in range(list1.size()): print list1.get(idx) list1.remove(3) print "Size is: " + str(list1.size()) for idx in range(list1.size()): print list1.get(idx)