Time to give back to the community.
Question 1 was exactly https://leetcode.com/problems/merge-k-sorted-lists/description/.
I solved using PriorityQueue but the interviewer was more interested towards Divide and Conquer approach for better space complexity.

Question 2 was https://leetcode.com/problems/construct-string-from-binary-tree/description/