‹ ›
XmonoCodes • Learn / Build / Grow

CREATIVITY
MEETS CODE.

Practical knowledge for students, developers and curious builders — from programming and web development to projects, notes and real-world problem solving.

  • “Learn something useful every day.”
  • “Build ideas into real projects.”
  • “Understand the why, not just the how.”
  • “Keep experimenting. Keep improving.”

Latest from XmonoCodes

Explore tutorials, notes, projects, syllabus material and practical coding content.

Monday, February 24, 2025

Adding new element in linked list at the end.

 #include <stdio.h>

#include <stdlib.h>


struct Node {

    int data;

    struct Node* next;

};


void insertAtEnd(struct Node** head, int value) {

    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));

    newNode->data = value;

    newNode->next = NULL;


    if (*head == NULL) {

        *head = newNode;

        return;

    }


    struct Node* temp = *head;

    while (temp->next != NULL) {

        temp = temp->next;

    }

    temp->next = newNode;

}


void printList(struct Node* head) {

    while (head != NULL) {

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

        head = head->next;

    }

    printf("NULL\n");

}


int main() {

    struct Node* head = NULL;


    insertAtEnd(&head, 10);

    insertAtEnd(&head, 20);

    insertAtEnd(&head, 30);


    printList(head);


    return 0;

}

No comments:

Post a Comment