merge_two_sorted_lists.py

# merge two sorted linked lists into l3 sorted linkedlist...
def solution(l1, l2):

    new_list = ListNode(0)
    current_node = new_list

    while l1 != None and l2 != None:
        if l1.val < l2.val:
            current_node.next = l1
            l1 = l1.next

        else:
            current_node.next = l2
            l2 = l2.next

        current_node = current_node.next

    if l1 != None:
        current_node.next = l1
        l1 = l1.next

    if l2 != None:
        current_node.next = l2
        l2 = l2.next

    return new_list.next