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

struct Node {
    int data;
    struct Node* next;
  };
  
  
  struct node* insertAtBegining(struct Node*head, int value) {
      struct node *newNode = (struct Node *)malloc(sizeof(struct Node));
      newnode->data = value;
      newnode-> = 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 = insertAtBegining(head, 10);
     head = insertAtBegining(head, 20);
     head = insertAtBegening(head, 30);
     
     printf("Linked List: \n");
     display(head);
     
     return 0;
     
}