ll

#include <stdio.h>
#include <stdlib.h>
typedef struct node
{
    int data;
    struct node *link;
};

struct node* create_node();

void traverse(struct node*);

void insert_at_end(struct node*,int);

struct node* init(int);

struct node* insert_at_beginin(struct node,int);

void insert_after_element(struct node*,int,int);

int main()
{
    int data;
    char ch;
    struct node *start=NULL;



    return 0;
}




struct node* create_node()
{
    struct node* temp;
    int tmp;
    temp = (struct node*)malloc(sizeof(struct node));
    return temp;
}


void traverse(struct node* ptr_S)
{
    while((*ptr_S).link!=NULL)
    {
        printf("%d",(*ptr_S).data);
        ptr_S = (*ptr_S).link;
    }
    printf("%d",(*ptr_S).data);
}

struct node* init(int data)
{
    struct node *ptr;
    ptr = create_node();
    ptr->data = data;
    ptr->link = NULL;
    return ptr;
}


struct node* insert_at_beginin(struct node *ptr,int data)
{
    struct node *tmp = create_node();
    tmp->link = ptr;
    tmp->data = data;
    return tmp;
}

void insert_at_end(struct node *ptr, int data)
{
    while(ptr->link!=NULL)
        ptr = ptr->link;
    ptr->link = create_node();
    ptr = ptr->link;
    ptr->data = data;
    ptr->link = NULL;
}

void insert_after_element(struct node *ptr, int data, int ele)
{
    struct node *tmp;
    while(ptr->data!=ele)
        ptr = ptr->link;
    tmp = create_node();
    tmp->link = ptr->link;
    ptr->link tmp;
    tmp->data = data;
}

void insert_before_element(struct node *ptr,int data,int ele)
{

}