def main(): llist = LinkedList() llist.push(7) llist.push(1) llist.push(3) llist.push(2) llist.push(8) llist.append(10) llist.insert(llist.get_head().get_next(), 5) llist.print_list() print(find_middle(llist)) llist.delete_node(2) llist.print_list() print(find_middle(llist))
def main(): # Create linked list : # 10->20->30->40->50 list1 = LinkedList() list1.append(10) list1.append(20) list1.append(30) list1.append(40) list1.append(50) print("Printing List1:") list1.print_list() # Create linked list 2 : # 5->15->18->35->60 list2 = LinkedList() list2.append(5) list2.append(15) list2.append(18) list2.append(35) list2.append(60) print("Prining List2:") list2.print_list() # Create linked list 3 list3 = LinkedList() # Merging linked list 1 and linked list 2 # in linked list 3 list3.head = merge_ll(list1.get_head(), list2.get_head()) print(" Merged Linked List is : ", end="") list3.print_list()
def main(): llist = LinkedList() llist.push(7) llist.push(1) llist.push(3) llist.push(2) llist.push(8) llist.append(10) llist.insert(llist.get_head().get_next(), 5) llist.print_list() print("Reversing a list") reverse(llist) llist.print_list() print("Reversing a list again using recursion") reverse_rec(llist) llist.print_list()
sum_list.append(remainder) else: carry = 0 sum_list.append(s) if p: p = p.next if q: q = q.next if carry: sum_list.append(carry) return sum_list l1 = LinkedList() l1.append(2) l1.append(1) l1.append(5) l1.print_list() # 5 -> 1 -> 2 -> l2 = LinkedList() l2.append(8) l2.append(3) l2.append(6) l2.print_list() # 8 -> 3 -> 6 -> sum_l = sum_two_lists(l1, l2) sum_l.print_list() # 0 -> 5 -> 1 -> 1 ->
llist.set_head(currX) # Second connect the next of current nodes temp = currX.get_next() currX.set_next(currY.get_next()) currY.set_next(temp) llist = LinkedList() llist.push(7) llist.push(1) llist.push(3) llist.push(2) llist.push(8) print("Created Linked List:") llist.print_list() swap_nodes(llist, 2, 1) llist.print_list() swap_nodes(llist,8,1) llist.print_list() swap_nodes(llist,2,7) llist.print_list() """ llist.delete_node_pos(4) print("\nLinked List after Deletion at position 4: ")