C++ : Linked List

Coding sederhana,..

#include
#include

struct node {
int data;
struct node* next;
};

int a,b,c,d,e,f;

struct node* BuildStack ()
{
struct node* satu = NULL;
struct node* dua = NULL;
struct node* tiga = NULL;
struct node* empat = NULL;
struct node* lima = NULL;

satu= (struct node*) malloc(sizeof(struct node));
dua= (struct node*) malloc(sizeof(struct node));
tiga= (struct node*) malloc(sizeof(struct node));
empat= (struct node*) malloc(sizeof(struct node));
lima= (struct node*) malloc(sizeof(struct node));

printf("Masukkan angka ke- 1 : "); scanf("%d",&a);
printf("Masukkan angka ke- 2 : "); scanf("%d",&b);
printf("Masukkan angka ke- 3 : "); scanf("%d",&c);
printf("Masukkan angka ke- 4 : "); scanf("%d",&d);
printf("Masukkan angka ke- 5 : "); scanf("%d",&e);

satu -> data = a;
satu -> next = dua;
dua -> data = b;
dua -> next = tiga;
tiga -> data = c;
tiga -> next = empat;
empat -> data = d;
empat -> next = lima;
lima -> data = e;
lima -> next = NULL;
return satu;
}




struct node* sisipkan()
{
struct node* satu = NULL;
struct node* dua = NULL;
struct node* tiga = NULL;
struct node* empat = NULL;
struct node* lima = NULL;
struct node* enam = NULL;

satu= (struct node*) malloc(sizeof(struct node));
dua= (struct node*) malloc(sizeof(struct node));
tiga= (struct node*) malloc(sizeof(struct node));
empat= (struct node*) malloc(sizeof(struct node));
lima= (struct node*) malloc(sizeof(struct node));
enam= (struct node*) malloc(sizeof(struct node));
printf("\n\nSisipkan : "); scanf("%d",&f);

satu -> data = a;
satu -> next = dua;
dua -> data = b;
dua -> next = tiga;
tiga -> data = c;
tiga -> next = enam;
enam -> data = f;
enam -> next = empat;
empat -> data = d;
empat -> next=lima;
lima -> data = e;
lima -> next = NULL;
return satu;
}




struct node* hapus()
{
struct node* satu = NULL;
struct node* dua = NULL;
struct node* tiga = NULL;
struct node* empat = NULL;
struct node* lima = NULL;
struct node* enam = NULL;

satu= (struct node*) malloc(sizeof(struct node));
dua= (struct node*) malloc(sizeof(struct node));
tiga= (struct node*) malloc(sizeof(struct node));
empat= (struct node*) malloc(sizeof(struct node));
lima= (struct node*) malloc(sizeof(struct node));
enam= (struct node*) malloc(sizeof(struct node));
printf("\n\nHapus : "); scanf("%d",&c);

satu -> data = a;
satu -> next = dua;
dua -> data = b;
dua -> next = enam;
tiga -> data = c;
tiga -> next = enam;
enam -> data = f;
enam -> next = empat;
empat -> data = d;
empat -> next =lima;
lima -> data = e;
lima -> next = NULL;
free(tiga);
return satu;
}



void main()
{
struct node* gelang;
gelang=BuildStack();
printf("\nHead : %d",gelang->data);
printf("\nTail : %d",
gelang->next->next->next->next->data);
 
printf("\nNode : %d - %d - %d - %d - %d",
gelang->data,gelang->next->data,
gelang->next->next->data,gelang->
next->next->next->data,gelang->
next->next->next->next->data);
free(gelang);

gelang=sisipkan();
printf("\nNode : %d - %d - %d - %d - %d - %d",
gelang->data,gelang->next->data,gelang->
next->next->data,gelang->next->next->
next->data,gelang->next->next->next->
next->data,gelang->next->next->next->
next->next->data);

gelang=hapus();
printf("\nNode : %d - %d - %d - %d - %d",
gelang->data,gelang->next->data,gelang->
next->next->data,gelang->next->next->
next->data,gelang->next->next->next->
next->data);



}