Class GfG

Programs/MergeKsortedLists.java:85–130

    
    
    class GfG
    {
        public static void printList(Node node)
        {
            while(node != null)
            {
                System.out.print(node.data + " ");
                node = node.next;
            }
        }
        
        public static void main (String[] args) {
            Scanner sc = new Scanner(System.in);
            
            int t = sc.nextInt();
            while(t-- > 0)
            {   
                int N = sc.nextInt();
                
                Node []a = new Node[N];
                
                for(int i = 0; i < N; i++)
                {
                    int n = sc.nextInt();
                    
                    Node head = new Node(sc.nextInt());
                    Node tail = head;
                    
                    for(int j=0; j<n-1; j++)
                    {
                        tail.next = new Node(sc.nextInt());
                        tail = tail.next;
                    }
                    
                    a[i] = head;
                }
                
                Solution g = new Solution();
                 
                Node res = g.mergeKList(a,N);
                if(res!=null)
                    printList(res);
                System.out.println();
            }
        }
    }