Scribd Logo
Upload

Welcome to Scribd!

  • Linked List Insertion at Beginning

    Uploaded by

    Sanju
    19 views11 pages
    The document describes code for inserting a node into a linked list at different locations: 1. The create() function creates an initial linked list by allocating nodes and linking them together based on user input. 2. The insert_end() function inserts a new node at the end of the linked list by traversing to the last node and linking the new node after it. 3. The insert_given() function inserts a new node after a specified existing node by traversing the list to find the node before the specified one and linking the new node between them.

    Original Description:

    program

    Original Title

    DS (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?

    Report this Document
    The document describes code for inserting a node into a linked list at different locations: 1. The create() function creates an initial linked list by allocating nodes and linking them together based on user input. 2. The insert_end() function inserts a new node at the end of the linked list by traversing to the last node and linking the new node after it. 3. The insert_given() function inserts a new node after a specified existing node by traversing the list to find the node before the specified one and linking the new node between them.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    19 views11 pages

    Linked List Insertion at Beginning

    Uploaded by

    Sanju
    The document describes code for inserting a node into a linked list at different locations: 1. The create() function creates an initial linked list by allocating nodes and linking them together based on user input. 2. The insert_end() function inserts a new node at the end of the linked list by traversing to the last node and linking the new node after it. 3. The insert_given() function inserts a new node after a specified existing node by traversing the list to find the node before the specified one and linking the new node between them.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 11

    Linked list insertion at beginning

    #include<stdio.h>
    #include<conio.h>
    #include<alloc.h>
    struct node
    {
    int info;
    struct node*link;
    };
    struct node*first;
    void main()
    {
    void create();
    void insert_end();
    void traverse();
    clrscr();
    create();
    insert_end();
    traverse();
    getch();
    }
    void create()
    {
    struct node *ptr,*cpt;
    char ch;
    ptr=(struct node*)malloc(sizeof(struct node));
    printf("Input first node information\n");
    scanf("%d",&ptr->info);
    first=ptr;
    do
    {
    cpt=(struct node*)malloc(sizeof (struct node));
    printf("Input next node information\n");
    scanf("%d",&cpt->info);
    ptr->link=cpt;
    ptr=cpt;
    printf("press Y/N for more node\n");
    ch=getch();
    }while(ch=='y');
    ptr->link=NULL;
    }
    void traverse()
    {
    struct node*ptr;
    printf("Traversing of linked list:\n");
    ptr=first;
    while(ptr!=NULL)
    {
    printf("Data:\t%d\n",ptr->info);

    printf("Link:\t%d\n",ptr->link);
    ptr=ptr->link;
    }
    }
    void insert_end()
    {
    struct node *ptr,*cpt;
    ptr=(struct node*)malloc(sizeof(struct node));
    printf("Input insertion-node information\n");
    scanf("%d",&ptr->info);
    printf("After insertion at end\n");
    cpt=first;
    while(cpt->link!=NULL)
    cpt=cpt->link;
    cpt->link=ptr;
    ptr->link=NULL;
    }

    OUTPUT

    OUTPUT

    Linked list insertion at end


    #include<stdio.h>
    #include<conio.h>
    #include<alloc.h>
    struct node
    {
    int info;
    struct node*link;
    };
    struct node*first;
    void main()
    {
    void create();
    void insert_end();
    void traverse();
    clrscr();
    create();
    insert_end();
    traverse();
    getch();
    }
    void create()
    {
    struct node *ptr,*cpt;
    char ch;
    ptr=(struct node*)malloc(sizeof(struct node));
    printf("input first node information\n");

    scanf("%d",&ptr->info);
    first=ptr;
    do
    {
    cpt=(struct node*)malloc(sizeof (struct node));
    printf("input next node information\n");
    scanf("%d",&cpt->info);
    ptr->link=cpt;
    ptr=cpt;
    printf("press Y/N for more node\n");
    ch=getch();
    }while(ch=='y');
    ptr->link=NULL;
    }
    void traverse()
    {
    struct node*ptr;
    printf("traversing of linked list:\n");
    ptr=first;
    while(ptr!=NULL)
    {
    printf("%d\n",ptr->info);
    ptr=ptr->link;
    }
    }
    void insert_end()
    {

    struct node *ptr,*cpt;


    ptr=(struct node*)malloc(sizeof(struct node));
    printf("input new node information\n");
    scanf("%d",&ptr->info);
    cpt=first;
    while(cpt->link!=NULL)
    cpt=cpt->link;
    cpt->link=ptr;
    ptr->link=NULL;
    }

    OUTPUT

    Linked list insertion at a given location


    #include<stdio.h>
    #include<conio.h>
    #include<alloc.h>
    struct node
    {
    int info;
    struct node*link;
    };
    struct node*first;
    void main()
    {
    void create();
    void insert_given();
    void traverse();
    clrscr();
    create();
    insert_given();
    traverse();
    getch();
    }
    void create()
    {
    struct node *ptr,*cpt;
    char ch;
    ptr=(struct node*)malloc(sizeof(struct node));
    printf("Input first node information\n");
    scanf("%d",&ptr->info);
    first=ptr;
    do
    {
    cpt=(struct node*)malloc(sizeof (struct node));
    printf("Input next node information\n");
    scanf("%d",&cpt->info);
    ptr->link=cpt;
    ptr=cpt;
    printf("press Y/N for more node\n");
    ch=getch();
    }while(ch=='y');
    ptr->link=NULL;
    }
    void traverse()
    {
    struct node*ptr;
    printf("Traversing of linked list:\n");
    ptr=first;
    while(ptr!=NULL)
    {
    printf("Data:\t%d\n",ptr->info);

    printf("Link:\t%d\n",ptr->link);
    ptr=ptr->link;
    }
    }
    void insert_given()
    {
    struct node *ptr,*cpt;
    int data;
    ptr=(struct node*)malloc(sizeof(struct node));
    printf("Input insertion-node information\n");
    scanf("%d",&ptr->info);
    printf("Input information of the node after which insertion is to be made\n");
    scanf("%d",&data);
    cpt=first;
    while(cpt->info!=data)
    cpt=cpt->link;
    ptr->link=cpt->link;
    cpt->link=ptr;
    }

    OUTPUT

    You might also like