Queue

선입선출 구조이다.

 

 

구현 사항

push : O(1)

pop : O(1)

front : O(1)

 

 

코드

template <typename _Ty>
class MyQueue {
public:
	explicit MyQueue() : lst_() {}
	
	~MyQueue() {}

public:
	inline void push(const _Ty& _val)
	{
		lst_.push_back(_val);
	}

	inline void push(_Ty&& _val)
	{
		lst_.push_back(std::move(_val));
	}

	inline void pop()
	{
		lst_.pop_front();
	}

	inline _Ty& front()
	{
		return lst_.front();
	}

	inline bool empty() const { return size() == 0; }

	inline const int& size() const { return lst_.size(); }

private:
	MyLinkedList<_Ty> lst_;
};