Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    Program 10

    Uploaded by

    EXECUTIVE ENGINEER TESTING DIV. SATARA

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Program 10

    Uploaded by

    EXECUTIVE ENGINEER TESTING DIV. SATARA
    12 views6 pages

    Original Title

    program10 (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    12 views6 pages

    Program 10

    Uploaded by

    EXECUTIVE ENGINEER TESTING DIV. SATARA

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 6

    Program 10

    Write a menu driven program to perform all opertions on singly linked list.
    #include <stdio.h>
    #include <stdlib.h>

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

    void createlist(int n);


    void insertnodeatbeginning(int data);
    void displaylist();
    void deleteFirstNode();
    void insertnodeatend(int data);
    void deleteLastNode();
    void deleteMiddleNode(int position);
    void insertnodeatmiddle(int data, int position);

    int main() {
    int n, data, choice, position;
    printf("Enter the total number of nodes: ");
    scanf("%d", &n);
    createlist(n);
    printf("\nData in the list:\n");
    displaylist();

    while(1) {
    printf("---LINKED LIST PROGRAMS---\n");
    printf("1. INSERT AT BEGINNING\n");
    printf("2. INSERT AT END\n");
    printf("3. DELETE FROM BEGINNING\n");
    printf("4. DELETE FROM END\n");
    printf("5. DISPLAY LIST\n");
    printf("6. EXIT\n");
    printf("7. DELETE FROM MIDDLE OR SPECIFIC POSITION\n");
    printf("8. INSERT AT MIDDLE OR SPECIFIC POSITION\n");
    printf("Enter your choice: ");
    scanf("%d", &choice);

    switch(choice) {
    case 1:
    printf("Enter data to insert at the beginning of the
    list: ");
    scanf("%d", &data);
    insertnodeatbeginning(data);
    break;
    case 2:
    printf("Enter data to insert at the end of the list:
    ");
    scanf("%d", &data);
    insertnodeatend(data);

    Program 10 Page 1
    Program 10
    break;
    case 3:
    deleteFirstNode();
    break;
    case 4:
    deleteLastNode();
    break;
    case 5:
    displaylist();
    break;
    case 6:
    exit(0);
    break;
    case 7:
    printf("Enter the node position you want to delete:
    ");
    scanf("%d", &position);
    deleteMiddleNode(position);
    break;
    case 8:
    printf("Enter data to insert at the middle of the
    list: ");
    scanf("%d", &data);
    printf("Enter the position to insert new node: ");
    scanf("%d", &position);
    insertnodeatmiddle(data, position);
    break;
    default:
    printf("Invalid choice\n");
    break;
    }
    }
    return 0;
    }

    void createlist(int n) {
    struct node *newnode, *temp;
    int data, i;
    head = (struct node*)malloc(sizeof(struct node));
    if (head == NULL) {
    printf("Unable to allocate memory.\n");
    return;
    }
    printf("Enter the data of node 1: ");
    scanf("%d", &data);
    head->data = data;
    head->next = NULL;
    temp = head;

    for (i = 2; i <= n; i++) {


    newnode = (struct node*)malloc(sizeof(struct node));

    Program 10 Page 2
    Program 10
    if (newnode == NULL) {
    printf("Unable to allocate memory.\n");
    break;
    }
    printf("Enter the data of node %d: ", i);
    scanf("%d", &data);
    newnode->data = data;
    newnode->next = NULL;
    temp->next = newnode;
    temp = temp->next;
    }
    printf("Singly linked list created successfully.\n");
    }

    void insertnodeatbeginning(int data) {


    struct node *newnode = (struct node*)malloc(sizeof(struct node));
    if (newnode == NULL) {
    printf("Unable to allocate memory.\n");
    } else {
    newnode->data = data;
    newnode->next = head;
    head = newnode;
    printf("Data inserted successfully.\n");
    }
    }

    void displaylist() {
    struct node *temp = head;
    if (head == NULL) {
    printf("List is empty.\n");
    } else {
    while (temp != NULL) {
    printf("Data = %d\n", temp->data);
    temp = temp->next;
    }
    }
    }

    void insertnodeatend(int data) {


    struct node *newnode, *temp;
    newnode = (struct node*)malloc(sizeof(struct node));
    if (newnode == NULL) {
    printf("Unable to allocate memory.\n");
    } else {
    newnode->data = data;
    newnode->next = NULL;
    if (head == NULL) {
    head = newnode;
    } else {
    temp = head;
    while (temp->next != NULL) {

    Program 10 Page 3
    Program 10
    temp = temp->next;
    }
    temp->next = newnode;
    }
    printf("Data inserted successfully.\n");
    }
    }

    void deleteFirstNode() {
    if (head == NULL) {
    printf("List is already empty.\n");
    } else {
    struct node *toDelete = head;
    head = head->next;
    printf("Data deleted = %d\n", toDelete->data);
    free(toDelete);
    printf("Successfully deleted first node from list\n");
    }
    }

    void deleteMiddleNode(int position) {


    if (head == NULL) {
    printf("List is already empty.\n");
    } else {
    struct node *toDelete = head, *prevNode = NULL;
    int i;
    for (i = 1; i < position && toDelete != NULL; i++) {
    prevNode = toDelete;
    toDelete = toDelete->next;
    }
    if (toDelete == NULL) {
    printf("Invalid position\n");
    } else {
    if (prevNode != NULL) {
    prevNode->next = toDelete->next;
    } else { // Deleting the head node
    head = toDelete->next;
    }
    free(toDelete);
    printf("Successfully deleted node from the middle of
    list\n");
    }
    }
    }

    void deleteLastNode() {
    if (head == NULL) {
    printf("List is already empty.\n");
    } else {
    struct node *toDelete = head, *prevNode = NULL;
    while (toDelete->next != NULL) {

    Program 10 Page 4
    Program 10
    prevNode = toDelete;
    toDelete = toDelete->next;
    }
    if (prevNode != NULL) {
    prevNode->next = NULL;
    } else { // If there is only one node in the list
    head = NULL;
    }
    printf("Data deleted = %d\n", toDelete->data);
    free(toDelete);
    printf("Successfully deleted last node from list\n");
    }
    }

    void insertnodeatmiddle(int data, int position) {


    struct node *newnode, *temp = head;
    int i;
    newnode = (struct node*)malloc(sizeof(struct node));
    if (newnode == NULL) {
    printf("Unable to allocate memory.\n");
    } else {
    newnode->data = data;
    if (position == 1) {
    newnode->next = head;
    head = newnode;
    } else {
    for (i = 2; i < position && temp != NULL; i++) {
    temp = temp->next;
    }
    if (temp != NULL) {
    newnode->next = temp->next;
    temp->next = newnode;
    } else {
    printf("Invalid position\n");
    return;
    }
    }
    printf("Data inserted at position %d successfully.\n",
    position);
    }
    }

    Program 10 Page 5
    Program 10

    Output
    Enter the total number of nodes: 5
    Enter the data of node 1: 1
    Enter the data of node 2: 2
    Enter the data of node 3: 3
    Enter the data of node 4: 4
    Enter the data of node 5: 5
    Singly linked list created successfully.

    Data in the list:


    Data = 1
    Data = 2
    Data = 3
    Data = 4
    Data = 5
    ---LINKED LIST PROGRAMS---
    1. INSERT AT BEGINNING
    2. INSERT AT END
    3. DELETE FROM BEGINNING
    4. DELETE FROM END
    5. DISPLAY LIST
    6. EXIT
    7. DELETE FROM MIDDLE OR SPECIFIC POSITION
    8. INSERT AT MIDDLE OR SPECIFIC POSITION

    Program 10 Page 6

    You might also like