Scribd Logo
Upload

Welcome to Scribd!

  • 24 views

    73.insert in LL PDF

    Uploaded by

    UDIT PATHAK
    This C code defines a linked list data structure with nodes that contain an integer data value and a pointer to the next node. It includes functions to create a linked list from an array, display the linked list, and insert a new node at a given index. The main function demonstrates creating a linked list from a sample array and inserting a new node at the beginning before displaying the resulting linked list.

    Copyright:

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

    73.insert in LL PDF

    Uploaded by

    UDIT PATHAK
    24 views3 pages
    This C code defines a linked list data structure with nodes that contain an integer data value and a pointer to the next node. It includes functions to create a linked list from an array, display the linked list, and insert a new node at a given index. The main function demonstrates creating a linked list from a sample array and inserting a new node at the beginning before displaying the resulting linked list.

    Original Description:

    asdjksadgkjshkjhsdjkafk sdgls hhasgj hhfkjagh jg ahsghhga g

    Original Title

    73.Insert-in-LL.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This C code defines a linked list data structure with nodes that contain an integer data value and a pointer to the next node. It includes functions to create a linked list from an array, display the linked list, and insert a new node at a given index. The main function demonstrates creating a linked list from a sample array and inserting a new node at the beginning before displaying the resulting linked list.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    24 views3 pages

    73.insert in LL PDF

    Uploaded by

    UDIT PATHAK
    This C code defines a linked list data structure with nodes that contain an integer data value and a pointer to the next node. It includes functions to create a linked list from an array, display the linked list, and insert a new node at a given index. The main function demonstrates creating a linked list from a sample array and inserting a new node at the beginning before displaying the resulting linked list.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    Linked List

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

    struct Node
    {
    int data;
    struct Node *next;
    }*first=NULL;

    void create(int A[],int n)


    {
    int i;
    struct Node *t,*last;
    first=(struct Node *)malloc(sizeof(struct Node));
    first->data=A[0];
    first->next=NULL;
    last=first;

    for(i=1;i<n;i++)
    {
    t=(struct Node*)malloc(sizeof(struct Node));
    t->data=A[i];
    t->next=NULL;
    last->next=t;
    last=t;
    }
    }

    void Display(struct Node *p)


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

    void Insert(struct Node *p,int index,int x)


    {
    struct Node *t;
    int i;

    if(index < 0 || index > count(p))


    return;
    t=(struct Node *)malloc(sizeof(struct Node));
    t->data=x;

    if(index == 0)
    {
    t->next=first;
    first=t;
    }
    else
    {
    for(i=0;i<index-1;i++)
    p=p->next;
    t->next=p->next;
    p->next=t;

    int main()
    {

    int A[]={10,20,30,40,50};
    create(A,5);

    Insert(first,0,5);
    Display(first);
    return 0;
    }

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy