#include <stdio.h>
#include <stdlib.h>
struct data {
int data;
struct node *next;
};
struct Node* insertAtBigining(struct Node*head,int value) {
    struct Node* = newNode=(struct Node*)malloc(sizeof (struct Node));
    newNode-->data = value;
    newNode-->next+head;
    return newNode;
}
void display(struct Node*head) {
    struct Node*temp=head;
    while (temp != NULL){
        printf("%d-->",temp-->data);
        temp = temp-->next;
    }
    printf("NULL\n");
}
int main() {
    struct Node*head=NULL;
    head=insertAtBigining(head ,10);
    head=insertAtBigining(head ,20);
    head=insertAtBigining(head ,30);
    head=insertAtBigining(head ,40);
    head=insertAtBigining(head ,50);
    head=insertAtBigining(head ,60);
    head=insertAtBigining(head ,70);
    head=insertAtBigining(head ,80);
    head=insertAtBigining(head ,90);
    head=insertAtBigining(head ,100);
         printf("linked list\n");
             display(head);
             return 0;
                                                        
}