DSAimplementations/queue_ll.cpp at main · kholiator/DSAimplementations · 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
100
101
102
103
104
105
#include<iostream>
using namespace std;
template<typename T>
class Node{

public:

T data;
Node<T>*nextNode;
// Node<T>*prevNode;

Node(T data){
    this->data=data;
    nextNode=NULL;
    // prevNode==NULL;
}
Node(){
    nextNode=NULL;
    // prevNode==NULL;
}

};

template<typename T>
class Queue{
    private:
    Node<T>*head;
    Node<T>*tail;
    int size;
    public:
    Queue(){
        head=NULL;
        tail=NULL;
        size=0;
    }

    int getSize(){
        return size;
    }
    bool isEmpty(){
        return size==0;
    }

    void enqueue(T element){
        Node<T>*newNode=new Node<T>(element);
        if(head==NULL){
            head=newNode;
            tail=newNode;
            size++;
        }
        else{
            tail->nextNode=newNode;
            tail=tail->nextNode;
            size++;
        }
    }

    T dequeue(){
        if(isEmpty()){
            cout<<"Empty Queue"<<endl;
            return 0;
        }
        Node<T>*temp=head;
        head=head->nextNode;
        size--;
        T ans=temp->data;
        delete temp;
        return ans;

    }
    T front(){
         if(isEmpty()){
            cout<<"Empty Queue"<<endl;
            return 0;
        }
        return head->data;

    }


};


int main(){

    Queue<int> q;
    q.enqueue(1);
    q.enqueue(2);
    q.enqueue(3);
    q.enqueue(4);
    q.enqueue(5);
    q.enqueue(6);
    cout<<q.front()<<endl;
    cout<<q.getSize()<<endl;
    cout<<q.dequeue()<<endl;
    cout<<q.dequeue()<<endl;
    cout<<q.dequeue()<<endl;
    cout<<q.dequeue()<<endl;
    cout<<q.dequeue()<<endl;
    cout<<q.dequeue()<<endl;
    cout<<boolalpha<<q.isEmpty()<<endl;
    cout<<q.dequeue()<<endl;


}