Cracking the Coding Interview: Merge two sorted lists Python.

This is another leetcode easy level problem and it is fundamental to as well learn how to quickly solve this when asked in an interview setting.

The Question:

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
Example:
Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4