Recursive, Recursive, Recursive...🤮

**Reference**

https://leetcode.com/problems/merge-two-sorted-lists/discuss/381943/python-concise-recursion-code

```
class Solution:
def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
if l1 is None and l2 is None:
return None
elif l1 is None:
return l2
elif l2 is None:
return l1
if l1.val < l2.val:
l1.next = self.mergeTwoLists(l1.next, l2)
return l1
else:
l2.next = self.mergeTwoLists(l1, l2.next)
return l2
```

## Top comments (3)

You can also do it iteratively. This is the merge part of the merge sort algorithm:

Great help. Thank you! ☺️

Oh! Thanks!

I'll try in python🙇🏻♂️