Struktur Data – Linked List
#include<stdlib.h>
#include<stdio.h>
struct linkedlist {
int val;
struct linkedlist * next;
};
typedef struct linkedlist item;
void main() {
item *head, *tail;
int i;
int input;
tail = NULL;
int x=1;
head = (item *)malloc(sizeof(item));
head->next=0;
do{
printf(“Masukan Angka ke %d [1..100] : “,x);
scanf(“%d”,&head->val);fflush stdin;
}
while(head->val<1 || head->val>100);
tail = head;
tail->next=(item *)malloc(sizeof(item));
tail=tail->next;
tail->next=0;
for(int i=0;i<10;i++){
system(“cls”);
tail=head;
int a=0;
while(tail->next!=0){
printf(“%d”,tail->val);
tail=tail->next;
if(i>0 && a!=(x-1)) printf(” -> “);
a++;
}
if(x<10){
do{
printf(“\nMasukkan Angke ke %d[1..100]:”,x+1);
scanf(“%d”,&tail->val);
fflush(stdin);
}
while(tail->val<1 || tail->val>100);
x++;
tail->next=(struct linkedlist*)malloc(sizeof(struct linkedlist));
tail=tail->next;
tail->next=0;
}
else printf(“\nEnd of the Program.\nPress Enter to exit the program.”);
}
getchar();
}
No Comments »
RSS feed for comments on this post. TrackBack URL