Data-Structures/QueueUsingArray.cpp at master · education-tech-stack/Data-Structures · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
#include<iostream>
using namespace std;
class queue
{
public:
    int data[100],top;
    queue()
    {
        top=-1;
    }
    int isempty()
    {
        if(top==-1)
        {
            cout<<"Stack underflow"<<endl;
            return 1;
        }
        else
            return 0;
    }
    int isfull()
    {
        if(top==99)
        {
            cout<<"Stack full"<<endl;
            return 1;
        }
        else
            return 0;
    }
    void push()
    {
        if(isfull())
        {
            return ;
        }
        else
        {
            top++;
            cout<<"Enter element "<<endl;
            cin>>data[top];
        }
    }
    void pop()
    {
        if(isempty())
        {
            return ;
        }
        else
        {
                int i;
                for( i=0;i<top;i++)
                {
                    data[i]=data[i+1];
                }
                top--;
                cout<<"Element poped"<<endl;
        }
    }
    void display()
    {
        if(isempty())
        {
            return ;
        }
        else
        {
            for(int i=top;i>=0;i--)
            cout<<data[i]<<"\t";
            cout<<endl;
        }
    }
};
main()
{
    queue sua;
    int opn;
    do{
        cout<<"1 => Push\t2 => Pop\t3 => Display\t 4.EXIT"<<endl;
        cout<<"Enter your choice"<<endl;
        cin>>opn;
        switch(opn){
            case 1:
                sua.push();
                break;
            case 2:
                sua.pop();
                break;
            case 3:
                sua.display();
                break;
            default:
                cout<<"An invalid choice!"<<endl;
            case 4:
                break;
        }
    }while(opn!=4);
}