Program to print linked list in reverse order using Recursion

August 29th, 2009  |  Published in Amit Sahrawat, Data Structures, Linux Sample Programs








/* Structure for a linked list*/
struct list{
    int num;
    struct list* next; /* pointer to next node in list*/
};

/* Function to print data in reverse order for a linked list, given the starting node pointer*/
void reverseprint(struct list* node)
{
               if(NULL == node)
                            return;
               reverseprint(node->next);
                 printf(“%d”,node->num);
}

/* Function to use the linked list functions*/
int main()
{
    struct list* node = NULL;
    int i;
    for(i=0; i < 10; i++)
    {
        insert(&node,i);
    }
    reverseprint(node);
}

Subscribe

Get articles in your inbox.

Enter your email address:

Join Us

Twitter Chatter


Recommendations

Archives

Categories