Contoh Linked List

hitung jumlah simpul :

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

atau

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

atau

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

membuat sebuah simpul yang ditunjuk pointer p :

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

menjadikan sebuah simpul (p) menjadi simpul awal :

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

insert kanan :

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

insert kiri :

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

insert tengah :

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

delete kiri :

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

atau

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

delete kanan :

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

atau

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

delete tengah :

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

atau

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

arahkan pointer agar menunjuk simpul n :

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

arahkan pointer agar menunjuk 2 simpul dari kanan :

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

Related posts:

1. double ended queue ciri2 double ended queue : kosong : L = R...
2. penyimpanan data untuk database berorientasi object Sistem penyimpanan untuk database berorientasi object berbeda dengan sistem penyimpanan...
3. double stack ciri2 double stack : stack 1 kosong : top1 =...

Related posts brought to you by Yet Another Related Posts Plugin.

Contoh Double Ended Queue

ciri2 double ended queue :

1. kosong : L = R + 1
2. penuh kanan : R = n – 1
3. penuh kiri : L = 0
4. penuh kanan dan kiri : R = n – 1 && L = 0
5. bisa diisi dari kanan : R < n
6. bisa diisi dari kiri : L > 0
7. ada isinya : L < R + 1

kondisi awal :

L = 0;
R = -1;

algoritma dasar double ended queue :

1. INSERT KANAN

   R = R + 1;
   Q[R] = X;

2. INSERT KIRI

   L = L - 1;
   Q[L] = X;

3. DELETE KANAN

   X = Q[R];
   R = R - 1;

4. DELETE KIRI

   X = Q[L];
   L = L + 1;

algoritma lengkap double ended queue :

1. INSERT KANAN

   void INSERT_KANAN(void){
     if(R < n-1){
        R  =  R + 1;
        Q[R]  =  X;
     }else{
        printf("antrian penuh kanan");
     }
   }

2. INSERT KIRI

   void INSERT_KIRI(void){
     if( L > 0){
         L = L - 1; 
         Q[L]  =  X;
     }else{
         printf("antrian penuh kiri");
     }
   }

3. DELETE KANAN

   void DELETE_KANAN(void){
     if(L < R+1){
        X  =  Q[R];
        R   =   R - 1;
     }else{
       printf("antrian kosong");
     }
   }

4. DELETE KIRI

   void DELETE_KIRI(void){
     if(L < R+1){
        X = Q[L];
        L = L + 1;
     }else{
        printf("antrian kosong");
     }
   }

Related posts:

1. circular queue ciri2 circular queue : kosong : counter = 0 penuh...
2. double stack ciri2 double stack : stack 1 kosong : top1 =...
3. single stack ciri2 single stack : kosong : top = -1 penuh...

Related posts brought to you by Yet Another Related Posts Plugin.

Contoh Circular Queue

ciri2 circular queue :

1. kosong : counter = 0
2. penuh : counter = n
3. bisa diisi : counter < n
4. ada isinya : counter > 0

kondisi awal :

f = 0;
r = -1;
counter = 0;

algoritma dasar circular queue :

1. INSERT

      R = (R+1) % n;
      Q[R] = X;
      Counter++;

2. DELETE

      X = Q[F];
      F =(F+1) % n;
      Counter--;

algoritma lengkap circular queue :

1. INSERT

   void INSERT(void){
       if(Counter < n){
           R = (R+1) % n;
           Q[R] = X;
           Counter++;
       }else{
           printf("antrian penuh");
       }
   }

2. DELETE

   void DELETE(void){
       if(Counter > 0){
           X = Q[F];
           F = (F+1) % n;
           Counter--;
      }else{
           printf("antrian kosong");
      }
   }

Related posts:

1. double ended queue ciri2 double ended queue : kosong : L = R...
2. single stack ciri2 single stack : kosong : top = -1 penuh...
3. double stack ciri2 double stack : stack 1 kosong : top1 =...

Related posts brought to you by Yet Another Related Posts Plugin.

Contoh Double Stack

ciri2 double stack :

1. stack 1 kosong : top1 = -1
2. stack 2 kosong : top2 = n
3. stack penuh (stack 1 dan stack 2 tidak bisa diisi) : top2 – top1 = 1
4. stack bisa diisi (stack 1 dan stack 2 tidak bisa diisi) : top2 – top1 > 1
5. stack 1 ada isinya : top1 > -1
6. stack 2 ada isinya : top2 < n

kondisi awal :

top1 = -1;
top2 = n;

algoritma dasar double stack :

1. PUSH stack 1

   top1 = top1 + 1;
   s[top1] = x;

2. POP stack 1

   x = s[top1];
   top1 = top1 - 1;

3. PUSH stack 2

   top2 = top2 - 1;
   s[top2] = x;

4. POP stack 2

   x = s[top2];
   top2 = top2 + 1;

algoritma lengkap double stack :

1. PUSH stack 1

   void PUSH1(void){
      if(top2 - top1 > 1){
          top1  =  top1 + 1;
          s[top1] = x;
      }else{
          printf( "stack penuh");
      }
   }

2. POP stack 1

   void POP1(void){
      if(top1 > -1){
          x  =  s[top1];
          top1 = top1 - 1;
      }else{
          printf( "stack 1 kosong");
      }
   }

3. PUSH stack 2

   void PUSH2(void){
      if(top2 - top1 > 1){
          top2  =  top2 + 1;
          s[top2] = x;
      }else{
          printf( "stack penuh");
      }
   }

4. POP stack 2

   void POP2(void){
      if(top2 < n){
          x  =  s[top2];
          top2 = top2 + 1;
      }else{
          printf( "stack 2 kosong");
      }
   }

Related posts:

1. single stack ciri2 single stack : kosong : top = -1 penuh...
2. double ended queue ciri2 double ended queue : kosong : L = R...
3. circular queue ciri2 circular queue : kosong : counter = 0 penuh...

Related posts brought to you by Yet Another Related Posts Plugin.

Contoh Single Stack

ciri2 single stack :

1. kosong : top = -1
2. penuh : top = n-1
3. bisa diisi : top < n-1
4. ada isinya : top > -1

kondisi awal :

top1 = -1;

algoritma dasar single stack :

1. PUSH

   top = top + 1;
   s[top] = x;

2. POP

   x = s[top];
   top = top - 1;

algoritma lengkap single stack :

1. PUSH

   void PUSH(void){
     if(top < n -1 ){
         top = top + 1;
         s[top] = x
       }else{
         printf("stack penuh");
       }
   }

2. POP

   void PUSH(void){
     if (top>-1){
          x = s[top];
          top = top - 1;
      }else{
          printf("stack kosong");
      }
   }

Related posts:

1. double stack ciri2 double stack : stack 1 kosong : top1 =...
2. double ended queue ciri2 double ended queue : kosong : L = R...
3. circular queue ciri2 circular queue : kosong : counter = 0 penuh...

Related posts brought to you by Yet Another Related Posts Plugin.