reversing linked list using recurtion
PrintReverse(Node head)
if head is NULL
return //Nothing to do!
PrintReverse((*head).next) //Print the remaining list
print head's value
Stack holding takes place recursively and list will be reversed recursively
Comments
Post a Comment