From f3ef5b64ae7c8c44405ba3804cd57f9b7e1d59f0 Mon Sep 17 00:00:00 2001
From: pandeyarun709 <pandeyarun709@gmail.com>
Date: Wed, 20 Mar 2019 13:24:23 +0530
Subject: [PATCH] Add Merge K sorted LinkedList

---
 .../Lists/Merge_K_SortedLinkedlist.java       | 63 +++++++++++++++++++
 1 file changed, 63 insertions(+)
 create mode 100644 DataStructures/Lists/Merge_K_SortedLinkedlist.java

diff --git a/DataStructures/Lists/Merge_K_SortedLinkedlist.java b/DataStructures/Lists/Merge_K_SortedLinkedlist.java
new file mode 100644
index 000000000..27b025214
--- /dev/null
+++ b/DataStructures/Lists/Merge_K_SortedLinkedlist.java
@@ -0,0 +1,63 @@
+import java.util.*;
+
+public class Merge_K_SortedLinkedlist {
+   
+   /*
+    * This function merge K sorted LinkedList
+    *  @param Node []a : array of LinkedList 
+    *  @param  int N  : size of array
+    *  
+    * author Arun Pandey (https://github.com/pandeyarun709)
+   */
+    Node mergeKList(Node[]a, int N)
+    {
+        // Min Heap
+        PriorityQueue<Node> min = new PriorityQueue<>(new Comparator<Node>(){
+              
+              public int compare(Node x , Node y){
+                  return x.data - y.data;
+              } 
+        }); 
+        
+        // adding head of all linkedList in min heap
+        for(int i =0 ; i< N ;i++)
+        {
+            min.add(a[i]);
+        }
+        
+        // Make new head among smallest heads in K linkedList 
+        Node head = min.poll();
+        min.add(head.next);
+        Node curr = head;
+
+        //merging LinkedList
+        while(!min.isEmpty()) {
+            
+            Node temp = min.poll();
+            curr.next = temp;
+            curr = temp;
+            
+            //Add Node in min Heap only if temp.next is not null
+            if(temp.next != null){
+                min.add(temp.next);
+            }
+        }
+        
+       return head;
+        
+   
+    }
+    
+    // Node Class
+    private  class Node{
+    	private int data;
+    	private Node next;
+    	
+    	public Node(int d)
+    	{
+    		this.data = d;
+    		next = null;
+    	}
+    }
+
+}
\ No newline at end of file