dsa-linkedList

#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)
{
    if(p!=NULL)
    {
        
        printf("%d ",p->data);
        display(p->next);
    
    }
}

void count(struct node *p)
{
    int c=0;
    while(p!=0)
    {
        c++;
        p=p->next;
    }
    printf("\ntotal numbers of node : %d",c);
    //return c;
}

void sum(struct node *p)
{
    int sum=0;
    while(p!=0)
    {
        sum =sum+p->data;
        p=p->next;
        
    }
    printf("\nsum of all integres : %d",sum);
}

int main()
{
    int A[20],n;
    
    printf("enter number of integers :");
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        printf("enter %d integers ",i+1);
        scanf("%d",&A[i]);
    }
    create(A,5);
    display (first);
    count(first);
    sum(first);
    //printf("number of nodes : %d",count(first));
    return 0;
}