# Problem Definition

## Description

Merge *k* sorted linked lists and return it as one sorted list. Analyze and describe its complexity.

Example:

```plaintext
Input:
[
  1->4->5,
  1->3->4,
  2->6
]
Output: 1->1->2->3->4->4->5->6
```

## Notes

1. [LeetCode discussion - A java solution based on Priority Queue](https://leetcode.com/problems/merge-k-sorted-lists/discuss/10528/A-java-solution-based-on-Priority-Queue)1. 
1. [LeetCode discussion - My simple java Solution use recursion](https://leetcode.com/problems/merge-k-sorted-lists/discuss/10522/My-simple-java-Solution-use-recursion)