leetcode

23. Merge k Sorted Lists

Recursive Divide And Conquer Solution

• Python code

Time complexity: O(n*log(k))

Space complexity: O(log(k))

Divide And Conquer Solution

• Python code

Time complexity: O(n*log(k))

Space complexity: O(k)

Heap Solution

• Java code
• Python code

Time complexity: O(n*log(k))

Space complexity: O(k)