6 - SLL Insert Akhir

#include<stdio.h>
#include<stdlib.h>

typedef struct simpul Node;
struct simpul{
    int data;
    Node *next;
};
Node *head = NULL, *p;
void alokasi();
void akhir();
void tampil();

int main(){
    char jwb;
    puts("Single Link List - Insert Akhir");
    do{
        fflush(stdin);
        alokasi();
        akhir();
        fflush(stdin);
        printf("Lagi? (y/t) ");
        jwb = getchar();
    }while(jwb == 'Y'||jwb == 'y');
    tampil();
    return 0;
}
void tampil(){
    Node *baca;
    printf("\n\nData yg ada dlm SLL\n");
    baca = head;
    while(baca != NULL){
        printf("%d\n", baca->data);
        baca = baca->next;
    }
}
void alokasi(){
    int x;
    printf("Nilai yang mau disimpan : ");
    scanf("%d", &x);
    p = (Node *) malloc(sizeof(Node));
    if(p==NULL){
        puts("Alokasi Gagal");
        exit(0);
    }else{
        p->data = x;
        p->next = NULL;
    }
}
void akhir(){
    Node *tail;
    if(head==NULL){
        head = p;
    }else{
        tail = head;
        while(tail->next != NULL)
            tail = tail->next;
        tail->next = p;
        tail = tail->next;


    }
}