Scribd Logo
Upload

Welcome to Scribd!

  • Insert Into End Linked List

    Uploaded by

    Pratik Salunke
    2 views1 page
    This C code defines a struct node containing an integer data and pointer link. It includes a function add_end that takes a head node and integer data as arguments. Add_end allocates a new node, sets its data and link, then traverses the linked list until the last node where it sets the link of that node to the new node. Main creates a head node, calls add_end twice to append nodes, then prints the list.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C code defines a struct node containing an integer data and pointer link. It includes a function add_end that takes a head node and integer data as arguments. Add_end allocates a new node, sets its data and link, then traverses the linked list until the last node where it sets the link of that node to the new node. Main creates a head node, calls add_end twice to append nodes, then prints the list.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    2 views1 page

    Insert Into End Linked List

    Uploaded by

    Pratik Salunke
    This C code defines a struct node containing an integer data and pointer link. It includes a function add_end that takes a head node and integer data as arguments. Add_end allocates a new node, sets its data and link, then traverses the linked list until the last node where it sets the link of that node to the new node. Main creates a head node, calls add_end twice to append nodes, then prints the list.

    Copyright:

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

    ;// Linked list (Adding element to end)

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

    struct node
    {
    int data;
    struct node* link;
    };

    void add_end(struct node* head,int d)


    {
    struct node* temp;
    struct node* ptr;

    ptr = head;

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


    temp->data= d;
    temp->link= NULL;

    while(ptr->link!=NULL) // Traversal till last node


    {
    ptr = ptr->link;
    }

    ptr->link= temp;
    }

    int main()
    {
    struct node* head = (struct node*) malloc(sizeof(struct node));

    head-> data= 32;


    head-> link = NULL;

    add_end(head,64);
    add_end(head,90);

    while(head!=NULL)
    {
    printf("%d\n",head->data);
    head = head->link;
    }

    return 0;
    }

    You might also like