How to make this program work for k sorted linked lists given by t test cases

#1
#2

hello @kishoretaru

so u want to merge k sorted linked list?
right?

#3

yes I want make it work for k

#4

u can do it using same merge function.

first megre first two list .it will give u a new list.

merge 3rd list with new list . it will again give u new list.
then merge 4th list with new list . it will again give u new list.

repeat this for k time.
after kth iteration , u will get ur resultant list.

#5

Can you change that in the code with comments

#6

try it bro , if u stuck then i will help.

#7

I have already given it a try but not able to figure out

#8

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.