Reverse Link-List

Without Recurtion :-)

struct node *p,*q,*r;
r=null;
p=head;
while(p)
{
   q=p->next;
   p->next=r;
   r=p;
   p=q;
}
head=p;




With recurtion :-)

list *tail; 
list *reverse (list *head) 
{ 
 if (head->next == NULL) 
 { 
   tail = head; 
   return; 
 }else{ 
   reverse (head->next); 
   head->next->next = head; 
   head->next = NULL; 
 } 
}  

<strong class="highlight">list</strong> *tail; <strong class="highlight">list</strong> *reverse (<strong class="highlight">list</strong> *head) { if (head->next == NULL) { tail = head; return; }else{ <strong class="highlight">reverse</strong> (head->next); head->next->next = head; head->next = NULL; } }

struct node *p,*q,*r; r=null; p=head; while(p) { q=p->next; p->next=r; r=p; p=q; } head=p;