(Node[]arr,int K)
| 49 | } |
| 50 | |
| 51 | Node mergeKList(Node[]arr,int K) |
| 52 | { |
| 53 | //Add your code here. |
| 54 | Node ans = null; |
| 55 | //Taking pair of sorted linked list and merging them, Storing their start point(head) |
| 56 | //in ans reference variable |
| 57 | for(Node i : arr) |
| 58 | { |
| 59 | ans = mergetwolist(i,ans); |
| 60 | } |
| 61 | return ans; |
| 62 | } |
| 63 | //Time Complexity : o(n^2) |
| 64 | //Space Complexity : o(1) |
| 65 | } |