Circular Linked list

 

#include <stdio.h>

#include <stdlib.h>

struct node

{

    int data;

    struct node *link;

};

void display(struct node *head)

{

    struct node *ptr = head;

    do

    {

        printf(" %d ", ptr->data);

        ptr = ptr->link;

    } while (ptr != head);

}

int main()

{

    struct node *a;

    struct node *b;

    struct node *c;

    struct node *d;

    a = malloc(sizeof(struct node));

    b = malloc(sizeof(struct node));

    c = malloc(sizeof(struct node));

    d = malloc(sizeof(struct node));

    a->data = 1;

    a->link = b;

    b->data = 2;

    b->link = c;

    c->data = 3;

    c->link = d;

    d->data = 4;

    d->link = a;

    display(a);

    return 0;

}