Merging two sorted linked lists can be done in linear time, O(n), where n is the total number of elements in both lists.
