All-Codes/queueUsingLL.h at main · swati354/All-Codes · 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
template <typename T>
class Node {
	public :
		T data;
		Node<T> *next;

		Node(T data) {
			this -> data = data;
			next = NULL;
		}
};


template <typename T>
class Queue {
	Node<T> *head;
	Node<T> *tail;
	int siz;

	public :

	Queue() {
        head = NULL;
        tail = NULL;
        siz = 0;
	}

	int getSize() {
        return siz;
	}

	bool isEmpty() {
        return siz==0;
	}

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

	T Front() {
	    if(head==NULL)
        return 0;
		return head->data;
	}

	T dequeue() {
	    T ans = head->data;
        Node<T> *temp = head;
        head = head->next;
        delete temp;
        siz--;
        return ans;
	}


};