Merge k Sorted ListsHard

Merge k sorted linked lists into one sorted list. Two approaches, same problem — a min-heap that repeatedly pops the smallest head, or divide & conquer that merges lists pairwise in O(log k) rounds.