DataStucturesLibraryCpp/queue.h at main · CoderChirag/DataStucturesLibraryCpp · 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
#ifndef QUEUE_H
#define QUEUE_H
namespace queue_node{
    template<class T>
    struct Node{
        T data;
        struct Node *next;
    };
}
template<class T>
class Queue{
    private:
        struct queue_node::Node<T> *front;
        struct queue_node::Node<T> *rear;
        int length;
    public:
        // Constructors
        Queue();
        Queue(int length, const T arr[]);

        // Accessors (Getter Functions)
        int size() const;
        T getFront() const;
        T getRear() const;

        // Mutators (Setter Functions)
        void enqueue(T data);
        T dequeue();

        // Facilitators
        void display() const;

        // Enquiry Functions
        bool isEmpty() const;

        // Operator Overloads
        template <class U>
        friend std::ostream &operator<<(std::ostream &cout, const Queue<U> &q);

        // Destructor
        ~Queue();
};
#endif