Remember
- Compare the two heads, take the smaller, advance that list. When one list ends, attach the rest of the other.
- Relink, do not copy: the merged list is made of the original nodes.
- k lists: keep the current heads in a min-heap, pop the smallest, push its successor. O(n log k).