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. Merge two sorted linked lists
  2. Discussions

Merge two sorted linked lists

  • clarify_me101
     + 0 comments

    Since the maximum number of elements is only 1000, you can use a simple trick here, 1) first get all the elements into a LIST and then sort it 2) afterwards you can create a new LInkedList from the sorted list

    def mergeLists(head1, head2):
    my_list = []
    node = head1
    while node is not None:
        my_list.append(node.data)
        node = node.next
    node2 = head2
    while node2 is not None:
        my_list.append(node2.data)
        node2 = node2.next
    my_list.sort()
    
    ll3 = SinglyLinkedList()
    for num in my_list:
        ll3.insert_node(num)
        
    return ll3.head