Q:

C Program to Display Nodes of Linked List using Recursion

0

Write a C Program to Display Nodes of Linked List using Recursion. Here’s simple Program to Display Nodes of Linked List using Recursion in C Programming Language.

All Answers

need an explanation for this answer? contact us directly to get an explanation for this answer

Recursion : :


  • Recursion is the process of repeating items in a self-similar way. In programming languages, if a program allows you to call a function inside the same function, then it is called a recursive call of the function.
  • The C programming language supports recursion, i.e., a function to call itself. But while using recursion, programmers need to be careful to define an exit condition from the function, otherwise it will go into an infinite loop.
  • Recursive functions are very useful to solve many mathematical problems, such as calculating the factorial of a number, generating Fibonacci series, etc.

Problem : :


This C Program uses recursive function & displays a linked list. A linked list is an ordered set of data elements, each containing a link to its successor.

 
 

Here is the source code of the C Program to Display Nodes of Linked List using Recursion. The C Program is successfully compiled and run on a Linux system. The program output is also shown below.


SOURCE CODE : :

/*  C Program to Display Nodes of Linked List using Recursion  */

#include <stdio.h>
#include <stdlib.h>

struct node
{
    int a;
    struct node *next;
};

void generate(struct node **,int size);
void display(struct node*);
void delete(struct node **);

int main()
{
    int size;
    struct node *head = NULL;

    printf("Enter size of linked list to generate :: ");
    scanf("%d",&size);
    generate(&head,size);
    printf("\nThe Linked List Generated is :: \n\n");
    display(head);
    printf("\n\n...........Deleting all nodes of the Generated Linked List.......\n");
    delete(&head);
    printf("\nDeletion of all nodes of Linked List is successful !!!!\n");

    return 0;

}

void generate(struct node **head,int size)
{
    int i;
    struct node *temp;

    for (i = 0; i < size; i++)
    {
        temp = (struct node *)malloc(sizeof(struct node));
        temp->a = i;
        if (*head == NULL)
        {
            *head = temp;
            (*head)->next = NULL;
        }
        else
        {
            temp->next = *head;
            *head = temp;
        }
    }
}

void display(struct node *head)
{
    printf("%d    ", head->a);
    if (head->next == NULL)
    {
        return;
    }
    display(head->next);
}

void delete(struct node **head)
{
    struct node *temp;
    while (*head != NULL)
    {
        temp = *head;
        *head = (*head)->next;
        free(temp);
    }
}

Output : :


/*  C Program to Display Nodes of Linked List using Recursion  */

Enter size of linked list to generate :: 10

The Linked List Generated is ::

9    8    7    6    5    4    3    2    1    0

...........Deleting all nodes of the Generated Linked List.......

Deletion of all nodes of Linked List is successful !!!!

Process returned 0

Above is the source code for C Program to Display Nodes of Linked List using Recursion which is successfully compiled and run on Windows System.The Output of the program is shown above .

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

C Recursion Solved Programs – C Programming

This question belongs to these collections

Similar questions


need a help?


find thousands of online teachers now
C Program Count Occurrence of Element in Linked Li... >>
<< C Program to Print linked list in reverse order us...