Problem_Solving/Queue.cpp at main · siddique0203/Problem_Solving · 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
#include<iostream>
using namespace std;

    const int size=5;
class queue{
public:
    int arr[size];
    int front=-1;
    int rear=-1;

  bool isEmpty(){
     return(front==-1 && rear==-1);
    }

  bool isFull(){
     return (rear==(size-1));
    }

  void enqueue(int x){
      if(isFull()){
        cout<<"Queue is full"<<endl;
      }

      else if(isEmpty()){
        front=rear=0;
        arr[rear]=x;
      }
      else{
        arr[++rear]=x;
      }

  }

  void dequeue(){
      if(isEmpty()){
        cout<<"Queue is empty"<<endl;
      }
      else if(front==rear){
        front=rear=-1;
      }
      else{
        front++;
      }
  }

  void frontElement(){
    cout<<"Front element is: "<<arr[front]<<endl;
  }

  void showQueue(){
    if(isEmpty()){
        cout<<"Queue is empty"<<endl;
    }
    else{
        for(int i=front; i<=rear; i++){
            cout<<arr[i]<<"  ";
        }cout<<endl;
    }

  }

};

int main(){


    queue q;
    q.enqueue(9);
    q.enqueue(0);
    q.enqueue(5);
    q.enqueue(6);
    q.enqueue(2);
    q.enqueue(4);
    q.showQueue();
    q.dequeue();
    q.showQueue();
    q.dequeue();
    q.showQueue();
    q.dequeue();
    q.showQueue();
    q.dequeue();
    q.showQueue();
    q.dequeue();
    q.showQueue();


}