queue-butuh-testing

#include <iostream>
using namespace std;

int main()
{
    int queue[5];
    int depan = -1;
    int belakang = -1;
    int pilihan, data, i;
    do {
        cout << "MENU" << endl;
        cout << "1. Enqueue" << endl;
        cout << "2. Dequeue" << endl;
        cout << "3. View" << endl;
        cout << "4. Exit" << endl;
        cout << "Masukkan Pilihan : "; cin >> pilihan;
        cout << endl;

        switch (pilihan) {
            case 1:
                if (belakang < 4) {
                    cout << "Data Masuk : ";
                    cin >> data;
                    queue[belakang + 1] = data;
                    belakang++;
                    if (belakang == 0)
                        depan = 0;
                }
                else
                    cout << "QUEUE PENUH" << endl;
                break;

            case 2:
                if (depan <= belakang) {
                    cout << "Data Keluar = " << queue[depan];
                    depan++;
                    belakang--;
                }
                else
                    cout << "QUEUE KOSONG" << endl;
                break;

            case 3:
                for (i = depan; i <= belakang; i++)
                    cout << "===== " << queue[i] << " =====" << endl;
                break;
        }

    cout << endl;
    } while (pilihan != 4);
    return 0;
}