LL7.c

#include<stdio.h>
#include<stdlib.h>
struct node
{
    char info;
    struct node *next;  
};
/*******************/
struct node *start;
/**************************/
struct node *getnode(){
    struct node*p;
    p=(struct node*)malloc(sizeof(struct node));
    return p;
}
/*****************/
int insertbegin(char x){
    struct node*p;
    p=getnode();
    p->info=x;
    p->next=start;
    start=p;
}
/***********/
int traverse()
{
    struct node *p;
    p=start;
    while(p!=NULL)
    {
        printf("%d ",p->info);
        p=p->next;
    }
    printf("\n");
}
/****************/
int insertend(char x)
{
    struct node *q,*p;
    q=start;
    while(q->next!=NULL)
    {
        q=q->next;
    }
    p=getnode();
    p->info=x;
    p->next=NULL;
    q->next=p;

}
/*****************/
int count(){
    int flag=0;
    struct node *p;
    p=start;
    while(p!=NULL){
        flag++;
        p=p->next;
    }
    printf("no. of nodes: %d \n",flag);
}
/*************************************/
int countevenodd()
{
    int flag1=0,flag2=0;
    struct node *p;
    p=start;
    while(p!=NULL)
    {
        if(p->info%2==0)
        {
            flag1++;
        }
        else
        {
            flag2++;
        }
        p=p->next;
    }
    printf("no. of even : %d \n",flag1);
    printf("no. of odd : %d \n",flag2);
}

    
/*************************************/

int delbeg(struct node **start)
{
    struct node *p;
    p=*start;
    int x=p->info;
    *start=(*start)->next;
    free(p);
    printf("\n\ndeleted item is: \n%d\n\n",x);


}
/*************************************/
int delend(struct node **start)
{
    struct node *p,*q;
    p=*start;
    q=NULL;
    while (p->next!=NULL){
        q=p;
        p=p->next;
    }
    q->next=NULL;
    int x=p->info;

    free(p);
    printf("\n\ndeleted item is: \n%d\n\n",x);


}
/*************************************/
int delaft(struct node **p){
    
    struct node *q,*r;
    q=(*p)->next;
    r=q->next;
    (*p)->next=r;
    r=q->info;
    printf("\n\ndeleted item is: \n%d\n\n",r);

}
/*************************************/
int delallocc(struct node **x){

}
int main(){
    start=NULL;
    char p;
     insertbegin('10');
     insertbegin('x');
     insertbegin('12');
     insertbegin('13');
     insertbegin('x');
     insertbegin('15');
     insertbegin('16');
     insertbegin('x');
     insertbegin('18');
     traverse();
     delbeg(&start);
     traverse();
     delend(&start);
     traverse();
     delaft(&start);
     traverse();
     
}