queue_STL.cpp

#include <cstdio>
#include <algorithm>
using namespace std;


template <typename T>
class _queue {
public:

	class Node {
	public:
		T data;
		Node *next;
		Node() {}
		Node(T data) :data(data),next(NULL){}
	};

	Node *Front = NULL;
	Node *Rear = NULL;
	int _size = 0;

	void push(T data) {
		
		Node *newNode = new Node(data);
		_size++;

		if (Front == 0) {
			Front = Rear = newNode;
		}
		else {
			Rear->next = newNode;
			Rear = newNode;
		}
	}

	void pop() {
		if (_size == 0)return;//오류
		_size--;

		Node *temp = Front;
		Front = temp->next;
		delete temp;
	}

	bool empty() {
		return size == 0;
	}
	T front() {
		return Front->data;
	}
	int size() {
		return _size;
	}

};