Reversing a linked list...

Hi everyone, I have been handed an assignment that reads like this:

"Write a program that reverses a linked list. Include the following functions in your program: (1) the function to insert a node into the beginning of the linked list; (2) the function to remove the first node from the linked list. Start with creating a linked list (L1) containing integers: 5, 7, 9, 11, 13, 15 (where 5 is in the first node of the resulting list, and 15 is in the last node.) Then call the function to delete the first node from (L1) and another function to insert it in the beginning of another linked list (L2). Continue while your list (L1) is not empty."

Can someone tell me how functions I will actually need and what they would do? I am not really understanding the question. I do not want anyone to write this for me, I just need some clarification. Thanks everyone!

Well it sounds like you'll need to create 2 functions:

(1) the function to insert a node into the beginning of the linked list

(2) the function to remove the first node from the linked list

The rest of the requirements just explain how/when to call those functions.

Those two functions have a body of really only one or two lines of code each.