reverse a doubly linked list
Write a program to reverse a doubly linked list.
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
void reverse_doubly_linked_list(struct node* head)
ReplyDelete{
struct node* ptr1=head;
if(head->next==NULL) return;
while(ptr1!=NULL)
{
struct node* agla=ptr1->next;
struct node* temp=ptr1->next;
ptr1->next=ptr1->previous;
ptr1->previous=temp;
ptr1=agla;
}
}
@ankit what is the use of using two different pointers agla and temp....can't it be done by temp only...
ReplyDelete@priyaranjan go it :)
ReplyDelete