Thread: Recursion

How do I modify code below to print a singly linked list where the data elements are int's from the front to back and then the back to front again. i.e., if the elements contain 1, 3, 5 ,7 ,9, the function should print out 1, 3, 5, 7, 9, 7, 5, 3, 1.

Code:

#include <stdio.h>

void recurse ( int count ) /* Each call gets its own copy of count */
{
    printf( "%d\n", count );
    /* It is not necessary to increment count since each function's
       variables are separate (so each count will be initialized one greater)
     */
    recurse ( count + 1 );
}

int main()
{
  recurse ( 1 ); /* First function call, so it starts at one */
  return 0;
}

Code:

#include <stdio.h>

void recurse ( struct node  *count ) /* Each call gets its own copy of count */
{
    
    printf( "%d\n", count->element );
  
    recurse ( count->next );  /*this is for front sequence,but this will go on forever,u need to have a check whether it has reached the end of the list*/
}

int main()
{
  recurse ( q ); //q is the address of the first node.
  return 0;
}