linked list

Q = FIRST;
Jum = 1;
while (Q != LAST)
  { Q = Q->LINK;
    Jum = Jum + 1;
  }
printf("%i", JUM);

Q = FIRST;
Jum = 1;
while (Q->LINK != NULL)
  { Q = Q->LINK;
    Jum = Jum + 1;
  }
printf("%i", JUM);

Q = FIRST;
Jum = 0;
while (Q != NULL)
  {  Jum = Jum + 1;
     Q = Q->LINK;
  }
printf("%i", JUM);

scanf ("%i", &x);
p = (simpul*)malloc(sizeof(simpul));
p->info = x;

first = p;
last = p;
p->link = null;

last->link = p;
last = p;
p->link = null;

p->info = x;
p->link = first;
first = p;

// dengan asumsi pointer q sudah ada di posisi insert tengah
p->link = q->link
q->link = p;

q = first;
first = q->link;
free(q);

q = first->link;
free(first);
first(q);

free(last);
last = q;
last->link = null;

last = q;
free(last->link);
last->link = null;

r = q->link->link;
free(q->link);
q->link = r;

// dengan asumsi pointer q sudah ada di posisi delete tengah
r = q->link;
q->link = r->link;
free(r);

Q = FIRST;
for( I=1; I<=n; I++) {
   Q = Q->LINK;
}

Q = FIRST;
while(Q->LINK!=LAST) {
   Q = Q->LINK;
}