algorithms.tutorialhorizon.com
Merge K sorted Linked List - Using Priority Queue | Algorithms
Objective: Given, K sorted linked list, Write an algorithm to merge all the linked list into one linked list which will be also be sorted. Example: List 1: -->1-->5 List 2: -->4-->8 List 3: -->4-->6-->9 List 4: -->2-->7-->10 Merged Linked List: -->1-->2-->4-->4-->5-->6-->7-->8-->9-->10