reverse a linked list
How can I reverse a linked list recursively with minimum number of temporary pointers
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
struct node* reverse(struct node *head)
ReplyDelete{
struct node *rest = head->next;
if(rest == NULL)
return head;
rest = reverse(head->next);
head->next->next = head;
head->next = NULL;
return rest;
}