CA 15 - Merge Two Linked List

Problem
You are given two sorted linked lists:
list1
list2
Merge them into one sorted linked list.

Correct Idea (Two Pointers)
create new nodes.
relink existing nodes.
Core Logic:
Compare current nodes of both lists
Attach the smaller one
Move forward
Repeat