reversing linked list

Question

I am trying to reverse a linked list using recursion and wrote the following code for it. The list is start of the list at the beginning.

 node *reverse_lis         


        

Answer 1

Some problems I could see:

• You need to make the next pointer of the new last node NULL.
• You existing function will blow if I pass NULL to it initially.