Merge K Sorted Lists

Problem:

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.

Examples:

1 -> 2 -> 3 -> 4 -> 4 -> 4
3 -> 5 -> 7 -> 8 -> 9
1 -> 4 -> 5 -> 6 -> 7 -> 7 -> 9

Merged List
[1,1,2,3,3,4,4,4,4,5,5,6,7,7,7,8,9,9]
				

Hints and Answer Checklist