Topic: Linked List Problem / Level: intermediate

Problem: How do you split a doubly linked list into two linked lists where one contains all odd-positioned nodes and the other contains even-positioned nodes?

Run the code to see the output here...