link

#include <stdio.h>
#include <stdlib.h>
struct node
{
    int id;
    double prize;
    struct node *next;
}*start=NULL;

void cre()
{
    struct node *c,*n;
    int a,i;
    printf("\nEnter book number:\n");
    scanf("%d",&a);
    for(i=0;i<a;i++)
    {
        n=(struct node*)malloc(sizeof(struct node));
        printf("Enter book id:\n");
        scanf("%d",&n->id);
        printf("Enter book prize\n");
        scanf("%lf",&n->prize);
        n->next=NULL;
        if(start == NULL)
        {
            start=n;
            c=n;
        }
        else
        {
            c->next = n;
            c=n;
        }

    }

}

void dis()
{
    struct node *c;
    c=start;
    while(c!=NULL)
          {
              printf("Id-->%d-->%.1lf-->",c->id,c->prize);
              c=c->next;
          }
          printf("NULL");
}
int pos(int a)
{
    int po=0,i=0;
    struct node *c;
    c=start;
    while(c!=NULL)
    {
        po++;
        if(c->id == a)
        {
            return po;
        }
        c=c->next;
    }
    return -1;
}
void mid()
{

}
void f()
{
    struct node *c,*n;
    printf("\nEnter a book details at the top:\n Enter Boook Id:\n");
    n=(struct node*)malloc(sizeof(struct node));
    scanf("%d",&n->id);
    printf("Enter prize:\n");
    scanf("%lf",&n->prize);
    n->next=NULL;
    c=start;
    n->next=c;
    start=n;

}
void last()
{
    struct node *c,*n;
    printf("\nEnter a book details at the last:\n Enter Boook Id:\n");
    n=(struct node*)malloc(sizeof(struct node));
    scanf("%d",&n->id);
    printf("Enter prize:\n");
    scanf("%lf",&n->prize);
    c=start;
   while(c->next != NULL)
   {
       c=c->next;
   }
   c->next=n;
   n->next=NULL;
}

void midb()
{
    struct node *c,*n,*t;
    printf("\nEnter a book details at mid:\n Enter Boook Id:\n");
    n=(struct node*)malloc(sizeof(struct node));
    scanf("%d",&n->id);
    printf("Enter prize:\n");
    scanf("%lf",&n->prize);
    int k,po=0;
    printf("Before Which Id:\n");
    scanf("%d",&k);
    po=pos(k);
    int i;
    c=start;
    for(i=0;i<po-2;i++)
    {
        c=c->next;
    }
    t=c->next;
    n->next=t;
    c->next=n;

}
void max()
{
    struct node *c;
    c=start;
    double max=0;
    while(c!=NULL)
    {
        if(max<c->prize)
        {
            max=c->prize;
        }
        c=c->next;
    }
    printf("\nHighest prize is %.1lf\n",max);
}
int main()
{
    cre();
    dis();
    f();
    dis();
    midb();
    last();
    dis();
    max();
    int k;
    printf("Enter a id to search:\n");
    scanf("%d",&k);
    int po=pos(k);
    if(po>0) printf("Found at %d\n",po);

}