Which optimized heap pattern solves this lesson cleanly?

Question

Which optimized heap pattern solves this lesson cleanly?

Option A — Correct answer

Min-heap multiway merge over current list heads.

Option B

Plain nested loops without ordering

Option C

Hash set lookup only

Option D

Binary search on unsorted input

Explanation

Min-heap multiway merge over current list heads.

Merge K Sorted Lists - Min-Heap Multiway Merge Pattern Practice Quiz