operasi single linked list pada stack

#include #include #include #define true 1 #define false 0 using namespace std; typedef struct node *simpul; struct node { char isi; simpul next; }; //============================= //==Prototype Function========= //============================= void Sisip_Belakang (simpul&L, char elemen); void Hapus_Belakang (simpul&L); void Cetak (simpul L); //============================= //==Function Main============== //============================= int main() { char huruf; simpul L=NULL; //Pastikan bahwa L kosong cout<<"NAMA : MUHAMAD HUSNIRAMADHAN"<>huruf; Sisip_Belakang(L, huruf); cout<<"Masukan Elemen : ";cin>>huruf; Sisip_Belakang(L, huruf); cout<<"Masukan Elemen : ";cin>>huruf; Sisip_Belakang(L, huruf); cout<<"Masukan Elemen : ";cin>>huruf; Sisip_Belakang(L, huruf); cout<<"Masukan Elemen : ";cin>>huruf; Sisip_Belakang(L, huruf); cout<<"Masukan Elemen : ";cin>>huruf; Sisip_Belakang(L, huruf); Cetak(L); //========================== //==Hapus Simpul Belakang=== //========================== cout< isi=elemen; baru-> next=NULL; if(L==NULL) L=baru; else { bantu=L; while(bantu->next!=NULL) bantu=bantu->next; bantu->next=baru; } } //****************** //*FUNCTION HAPUS SIMPUL DI BELAKANG****** //****************** void Hapus_Belakang (simpul&L) { simpul bantu, hapus; if(L==NULL) cout<<"Linked List Kosong............."; else { bantu=L; while(bantu->next->next!=NULL) bantu=bantu->next; hapus=bantu->next; bantu->next=NULL; free(hapus); } } //************* //*FUNCTION MENCETAK ISI LINKED LIST* //officialdansk //************* void Cetak(simpul L) { simpul bantu; if(L==NULL) cout<<"Linked List Kosong........."<next!=NULL) { cout<isi<<"->"; bantu=bantu->next; } cout<isi; } }