Question:
Merging Sorted Lists Using Heaps
Figuring out an algorithm that will merge k sorted lists into one sorted lists in O(n lg k) time where n is the number of elements in ALL the input lists.
Believe we are supposed to use a Heap for k-way merging.