Linked List. #include #include #include

// Created by Andri Andriyan // Linked List #include <stdlib.h> #include #include <stdio.h> typedef struct simpulabjad *point; typedef struct simpulabjad { char info; point next; }; point awal,akhir; char abjad; void isi_abjad(char abjad); void sisipan_awal(point *awal, point *akhir, char abjad); void sisipan_akhir(point *awal, point *akhir, char abjad); void sisipan_tengah(point *awal, point *akhir,char abjad,int n); void hapus_abjad(char abjad); void hapus_awal(point *awal, point *akhir); void hapus_akhir(point *awal, point *akhir); void hapus_tengah(point *awal, point *akhir,int n); void tampilan(point awal); main() { char abjad; char tekan; do{ system("cls"); gotoxy(3,21);printf("Tekan 1 untuk Penyisipan gerbong"); gotoxy(3,22);printf("Tekan 2 untuk Menghapus gerbong"); gotoxy(3,23);printf("Tekan 0 untuk keluar"); tampilan(awal); tekan=getch(); switch(tekan) { case '1' : isi_abjad(abjad); break; case '2' : hapus_abjad(abjad);

break; case '0': exit(0); } }while(tekan!=0); getch(); } void tampilan(point awal) { point p; int i=0; gotoxy(3,9);printf(" [] "); gotoxy(3,10);printf(" ----"); gotoxy(3,11);printf(" //++|"); gotoxy(3,12);printf("//-=-|"); gotoxy(2,13);printf("(------"); gotoxy(5,14); printf("ÈÍÍÍÍÍÍÍÍ¼"); if(awal!=NULL) { p=awal; while(p!=NULL) { gotoxy(10+12*i,10); printf("ÉÍÍÍÍÍÍÍÍÍ»"); gotoxy(10+12*i,11); printf("º Gerbong º"); gotoxy(10+12*i,12); printf("º º"); gotoxy(10+12*i,12); printf("º%5c ",p->info); gotoxy(10+12*i,13); printf("ÈÍÍÍÍÍÍÍÍÍ¼"); i++; p=p->next; } printf("\n"); } else { gotoxy(10+12*i,10); printf("ÉÍÍÍÍÍÍÍÍ»"); gotoxy(10+12*i,11); printf("º LINKED º");

gotoxy(10+12*i,12); printf("º--------º"); gotoxy(10+12*i,12); printf("º KOSONG º"); gotoxy(10+12*i,13); printf("ÈÍÍÍÍÍÍÍÍ¼"); } } void isi_abjad(char abjad) { char tekan=0; int n; gotoxy(3,2);printf("Masukan abjad : "); abjad=getche(); getch(); do{ textcolor(7); gotoxy(3,3); printf("1. Sisipan di bagian Belakang Loco "); gotoxy(3,4); printf("2. Sisipan di bagian Belakang Gerbong "); gotoxy(3,5); printf("3. Sisipan di Bagian Tengah Gerbong "); gotoxy(3,2); printf("Pilih : "); clreol(); tekan=getche(); switch(tekan) { case '1' : sisipan_awal(&awal,&akhir,abjad); break; case '2' : sisipan_akhir(&awal,&akhir,abjad); break; case '3' : sisipan_tengah(&awal,&akhir,abjad,n); break; } }while(tekan!='1'&&tekan!='2'&&tekan!='3'); }

void sisipan_awal(point *awal, point *akhir, char abjad)

{ point baru; baru=(point)malloc(sizeof(simpulabjad)); if (baru!=NULL) { baru->info=abjad; baru->next=NULL; if(*awal==NULL) { *awal=baru; *akhir=baru; } else { baru->next=*awal; *awal=baru; } } getch(); } void sisipan_akhir(point *awal, point *akhir,char abjad) { point baru; char tekan; baru = (point)malloc(sizeof(simpulabjad)); if(baru!=NULL) { baru->info=abjad; baru->next=NULL; if(*awal==NULL) { *awal=baru; *akhir=baru; } else { (*akhir)->next=baru; *akhir=baru; } } getch(); }

void sisipan_tengah(point *awal, point *akhir,char abjad,int n) { int i,no; point bantu,baru; if(*awal==NULL) { sisipan_awal(awal,akhir,abjad); } else { i=1; bantu=*awal; while(bantu->next!=NULL) { bantu=bantu->next; i++; } if(n<=1) sisipan_awal(awal,akhir,abjad); else if(n>i) sisipan_akhir(awal,akhir,abjad); else { baru=(point)malloc(sizeof(simpulabjad)); if(baru!=NULL) { baru->info=abjad; baru->next=NULL; bantu=*awal; no=1; while(no<(n-1)) { bantu=bantu->next; no++; } baru->next=bantu->next; bantu->next=baru; } else printf("Memori habis"); } } getch(); }

void hapus_abjad(char abjad) { char tekan=0; int n; do{ textcolor(7); gotoxy(3,3); printf("1. Hapus di bagian Belakang Loco "); gotoxy(3,4); printf("2. Hapus di bagian Belakang Gerbong "); gotoxy(3,5); printf("3. Hapus di Bagian Tengah Gerbong "); gotoxy(3,2); printf("Pilih : "); clreol(); tekan=getche(); switch(tekan) { case '1' : hapus_awal(&awal,&akhir); break; case '2' : hapus_akhir(&awal,&akhir); break; case '3' : hapus_tengah(&awal,&akhir,n); break; } }while(tekan!='1'&&tekan!='2'&&tekan!='3'); } void hapus_awal(point *awal, point *akhir) { point hapus; if(*awal==NULL) { gotoxy(3,19);printf("Gerbong Tidak bisa dihapus. Data Kosong.\n"); getch(); } else if(*awal==*akhir) { free(*awal); *awal=*akhir=NULL; } else

{ hapus=*awal; *awal=(*awal)->next; free(hapus); } getch(); } void hapus_akhir(point *awal, point *akhir) { point hapus,bantu; if(*awal==NULL) { gotoxy(3,19);printf("Gerbong Tidak bisa dihapus, Data Kosong.\n"); getch(); } else if(*awal==*akhir) { free(*akhir); *akhir=*awal=NULL; } else { bantu=*awal; while(bantu->next!=*akhir) { bantu=bantu->next; } free(*akhir); bantu->next=NULL; *akhir=bantu; } getch(); } void hapus_tengah(point *awal, point *akhir, int n) { int i,hapus; point bantu,bantu2; if(*awal==NULL) { gotoxy(3,19);printf("Gerbong Dalam Linked List Kosong, Data Kosong \n"); getch(); } else {

i=1; bantu=*awal; while(bantu->next!=NULL) { bantu=bantu->next; i++; } if((n<1)||(n>i)) { gotoxy(3,19);printf("Gerbong Ditengah Linked List Kosong"); getch(); } else if(n==1) hapus_awal(awal,akhir); else if(n==i) hapus_akhir(awal,akhir); else { bantu=*awal; hapus=1; while(hapus<(n-1)) { bantu=bantu->next; hapus++; } bantu2=bantu->next; bantu->next=bantu2->next; free(bantu2); } } getch(); }

This document was created with Win2PDF available at http://www.daneprairie.com. The unregistered version of Win2PDF is for evaluation or non-commercial use only.

Linked List. #include #include #include

Recommend Documents