Given a pointer to a doubly linked linear list create a new doubly linked list with every 3rd node in the original list. When you are done the first list will have its original nodes minus the ones you remove and the second list will have the remaining nodes. Example original list (doubly linked) 6 12 9 14 19 5 8 16 24 10 21 4 17

End result 2 lists

Original List 6 12 14 19 8 16 10 21 17

2nd list 9 5 24 4