C Program to Print the Alternate Nodes in a Linked List using Recursion
Posted by Superadmin on December 09 2015 05:20:53

---

This C program, using recursion, displays the alternate nodes in 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 a linked list in reverse. The C program is successfully compiled and run on a Linux system. The program output is also shown below.

/*
* C Program to Print the Alternate Nodes in a Linked List using Recursion
*/
#include <stdio.h>
#include <stdlib.h>

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

void generate(struct node **);
void display(struct node *);
void delete(struct node **);

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

generate(&head);
printf("\nDisplaying the alternate nodes\n");
display(head);
delete(&head);

return 0;
}

void display(struct node *head)
{
static flag = 0;
if(head != NULL)
{
if (!(flag % 2))
{
printf("%d ", head->a);
}
flag++;
display(head->next);
}
}

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

printf("Enter length of list: ");
scanf("%d", &num);
for (i = num; i > 0; 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 delete(struct node **head)
{
struct node *temp;
while (*head != NULL)
{
temp = *head;
*head = (*head)->next;
free(temp);
}
}

$ gcc alter_display.c -o alter_display
$ a.out
Enter length of list: 10

Displaying the alternate nodes
1 3 5 7 9