Method mergetwolist

Programs/MergeKsortedLists.java:7–49

(Node head1, Node head2)

    //Function to merge K sorted linked list.
    //Logic for merging two sorted linked list
    Node mergetwolist(Node head1, Node head2)
    {
     Node a = head1;
     Node b = head2;
     Node head = null;
     Node tail = null;
     
     if(a==null)return b;
     if(b==null)return a;
     
     if(a.data<b.data)
     {
        head = a;
        tail = a;
        a = a.next;
     }
     else
     {
         head = b;
         tail = b;
         b = b.next;
     }
     
     while(a!=null && b!=null)
     {
         if(a.data<b.data)
         {
            tail.next = a;
            tail = a;
            a = a.next;
        }
        else
        {
            tail.next = b;
            tail = b;
            b = b.next;
        }
     }
     if(a==null)tail.next=b;
     if(b==null)tail.next=a;
     
     return head;
   } 
    
    Node mergeKList(Node[]arr,int K)
    {