Breaking News: Grepper is joining You.com. Read the official announcement!

C program that demonstrates how to insert a node at the end, beginning, and a specific position in a singly linked list.

isuro answered on November 28, 2023 Popularity 1/10 Helpfulness 1/10

answer C program that demonstrates how to insert a node at the end, beginning, and a specific position in a singly linked list.

C program that demonstrates how to insert a node at the end, beginning, and a specific position in a singly linked list.

Comment

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

// Define a node structure
struct Node {
    int data;
    struct Node* next;
};

// Function to create a new node
struct Node* createNode(int data) {
    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
    newNode->data = data;
    newNode->next = NULL;
    return newNode;
}

// Function to insert a node at the end of the linked list
void insertAtEnd(struct Node** head, int data) {
    struct Node* newNode = createNode(data);

    if (*head == NULL) {
        *head = newNode;
        return;
    }

    struct Node* temp = *head;
    while (temp->next != NULL) {
        temp = temp->next;
    }

    temp->next = newNode;
}

// Function to insert a node at the beginning of the linked list
void insertAtBeginning(struct Node** head, int data) {
    struct Node* newNode = createNode(data);
    newNode->next = *head;
    *head = newNode;
}

// Function to insert a node at a specific position in the linked list
void insertAtPosition(struct Node** head, int data, int position) {
    struct Node* newNode = createNode(data);

    if (position == 0) {
        newNode->next = *head;
        *head = newNode;
        return;
    }

    struct Node* temp = *head;
    for (int i = 0; i < position - 1 && temp != NULL; i++) {
        temp = temp->next;
    }

    if (temp == NULL) {
        printf("Invalid position\n");
        return;
    }

    newNode->next = temp->next;
    temp->next = newNode;
}

// Function to display the linked list
void displayList(struct Node* head) {
    while (head != NULL) {
        printf("%d -> ", head->data);
        head = head->next;
    }
    printf("NULL\n");
}

// Function to free the memory allocated for the linked list
void freeList(struct Node* head) {
    struct Node* temp;
    while (head != NULL) {
        temp = head;
        head = head->next;
        free(temp);
    }
}

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

    // Insert at the end
    insertAtEnd(&head, 1);
    insertAtEnd(&head, 2);
    insertAtEnd(&head, 3);

    // Display the list
    printf("Linked List: ");
    displayList(head);

    // Insert at the beginning
    insertAtBeginning(&head, 0);

    // Display the updated list
    printf("Linked List after insertion at the beginning: ");
    displayList(head);

    // Insert at a specific position
    insertAtPosition(&head, 4, 2);

    // Display the updated list
    printf("Linked List after insertion at position 2: ");
    displayList(head);

    // Free the allocated memory
    freeList(head);

    return 0;
}

Popularity 1/10 Helpfulness 1/10 Language c

Source: chat.openai.com

Tags: c insert position

Link to this answer
Share Copy Link

Contributed on Nov 28 2023

isuro

0 Answers Avg Quality 2/10

C program that demonstrates how to insert a node at the end, beginning, and a specific position in a singly linked list.

Contents

More Related Answers

C program that demonstrates how to insert a node at the end, beginning, and a specific position in a singly linked list.

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.