insert_ll

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

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

//creating a linked list
node* create_ll(int data){
    node* current;
    current=(node*)malloc(sizeof(node));
    current->data=data;
return current;
}

//adding a node at the end
void add_at_end(node **head, int data ){
    node* new_node=create_ll(data);
    new_node->next=NULL;
    if(*head==NULL){
        *head=new_node;
    }
    else{
        node* temp= *head;
        while(temp->next!=NULL){
            temp=temp->next;
        }
        temp->next=new_node;
    }
}

//adding a node at the beginning
void add_at_start(node **head, int data){
    node* new_node=create_ll(data);
    new_node->next=*head;
    *head=new_node;
}

//adding node at any position
void add_at_position(node **head, int position, int data){
    node* new_node=create_ll(data);
    int i=1;
    node* temp=*head;
    if(position==1){
        add_at_start(head, data);
    }
    else{
    while(i<position-1){
        temp=temp->next;
        i++;
    }
    new_node->next=temp->next;
    temp->next=new_node;
    }
}

//printing a linked list
void print(node *head){

    while(head!=NULL){
        printf("%d\n", head->data);
        head=head->next;
    }
}
int main(){
    node* head=NULL;
    node* tail;
    int n=0;
    printf("Enter the number of data: ");
    scanf("%d", &n);
    for(int i=0;i<n;i++){
        add_at_end(&head, i+1);
    }
 return 0;
}