Merge sorted linked lists by moving pointers: a dummy head, a tail, and the smaller front node each time. O(m + n) and no new nodes, against copying to an array and sorting. Then k lists, merged in pairs.
This interactive visualization needs JavaScript.