Insert Node At The End of The Circular Linked List

Insert Node At The End of The Circular Linked List

In this post, you will learn how you can insert a node at the end of the circular linked list.

Code

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

struct node *head = NULL;

void insertAtEnd(int a){
    struct node *new = malloc(sizeof(struct node));
    new->data = a;

    if(head==NULL){
        new->next=new;
        head = new;
    }
    else{
        struct node *temp = head;
        while (temp->next!=NULL)
        {
            temp = temp->next;
        }
        temp->next = new;
        new->next = head;
    }
}

In this code we are doing following things:

1. If linked list is empty then make the node as head and its next pointer points to itself.
2. Else make a new pointer say temp which iterates from first to last node.
3. Then insert the node at the end of the linked list and points to the previous head.
4. So this is how we insert a new node at the beginnig of the circular linked list.

So this is how the function is working.

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

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

struct node *head = NULL;

void insertAtEnd(int a){
    struct node *new = malloc(sizeof(struct node));
    new->data = a;

    if(head==NULL){
        new->next=new;
        head = new;
    }
    else{
        struct node *temp = head;
        while (temp->next!=NULL)
        {
            temp = temp->next;
        }
        temp->next = new;
        new->next = head;     
    }
}

void print()
{
    struct node *p = head;

    while(temp != NULL)
    {
         printf("%d ", p->data);
         p = p->next;
    }
}

int main()
{

     insertAtEnd(1);
     insertAtEnd(2);
     insertAtEnd(3);
     print();

     return 0;
}