Struktur Data
Abdul Karim Syahputra, M.Kom
#include <stdio.h>
#include <conio.h>
#include <iostream.h>
#define MAX 6
//pembuatan struct
struct Queue
{
int data[MAX];
int head;
int tail;
};
struct Queue antrian;
//proses inisialisasi
void Create()
{
antrian.head=antrian.tail=-1;
}
//Operasi Clear
void Clear()
{
antrian.head=antrian.tail=-1;
cout<<"\n Data Clear";
}
//Operasi Tampil
void Tampil()
{
if (IsEmpty()==0)
for (int i=antrian.head;i<=antrian.tail; i++)
cout<<antrian.data[i]<<" ";
else
cout<<"\n Data Kosong";
}
//Isi
void main()
{
int pil;
int data;
Create();
do
{
clrscr();
cout<<"\n============ MENU PILIHAN ============\n";
cout<<"1. Enqueue\n";
cout<<"2. Dequeue\n";
cout<<"3. Tampil\n";
cout<<"4. Clear\n";
cout<<"5. Keluar\n";
cout<<"-------------------------------------------\n";
cout<<"\n";
cout<<"Masukkan Pilihan Anda [1][2][3][4][5] : -> ";
cin>>pil;
switch(pil)
{
case 1:
cout<<"-------------------------------------- \n";
cout<<"\n Inputkan Data : ";cin>>data;
cout<<"-------------------------------------- \n";
cout<<" \n";
cout<<"Data yang masuk : ";Enqueue(data);
break;
case 2:
if (IsEmpty()==0)
cout<<"\n Elemen yang keluar : "<<Dequeue();
else
cout<<"\n Data Kosong"<<endl;
break;
case 3:
cout<<"\n Isi Data Antrian: \n";
cout<<"--------------------------------------- \n";
cout<<"\n";
Tampil();
break;
case 4:
Clear();
break;
case 5:
break;
}
getch();
clrscr();
}
while(pil!=5);
}