Merge k sorted lists
Merge k sorted linked lists into one sorted list. Compare a min-heap of list heads with pairwise merging, and give the time complexity in terms of the total number of nodes and k.
MetaTechnical phone screenNo answer yet. Write the first one; the best answer gets endorsed.