Append_DS.txt

#include<stdio.h>
#include<malloc.h>

typedef struct list
{
    int data;
    struct list *next;
} list;

void insert_end(list **head,int value)
{
    list *node=(list *)malloc(sizeof(list));

    node->data=value;
    node->next=NULL;

    list *p;
    if(*head==NULL)
    {
        *head=node;
    }
    else
    {
        p= *head;
        while(p->next !=NULL)
        {
            p=p->next;
        }
        p->next=node;
    }
}

void print(list *head)
{
    if(head==NULL)
    {
        printf("list is empty\n");
    }
    else
    {
        while(head !=NULL)
        {
            printf("%d -> ",head->data);
            head=head->next;
        }
        printf("NULL\n");
    }
}

int main()
{
    list *head1=NULL;
    list *head2=NULL;

    int i,n,value;

    printf("Enter number for list 1: ");
    scanf("%d",&n);

    for(i=0; i<n; i++)
    {
        scanf("%d",&value);
        insert_end(&head1,value);
    }
    print(head1);

    printf("\n");

    printf("Enter number for list 2 : ");
    scanf("%d",&n);

    for(i=0; i<n; i++)
    {
        scanf("%d",&value);
        insert_end(&head2,value);

    }
    print(head2);

    list *p=head2;

    while(p !=NULL)
    {
        insert_end(&head1,p->data);
        p=p->next;
    }

    printf("\n\n");

    print(head1);

    return 0;
}