Reverse a linked list recursively (reverse function) Reverse a linked list iteratively (i_reverse function).

node* reverse(node *r)

{

      if(r->next!=NULL)

      {

            reverse(r->next);

            r->next->next=r;

            return r;

      }

      else

            start=r;

}

void i_reverse()

{

      node *p=start,*q=p->next,*r=q->next;

      p->next=NULL;

      while(q!=NULL)

      {

            q->next=p;

            p=q;

            q=r;
            if( r != NULL)

                 r=r->next;

      }

      start=p;

}