C++实现环形队列

//MyQueue.h文件
#ifndef MYQUEUE_H

#define MYQUEUE_H
class MyQueue
{
public:
	MyQueue(int queueCapacity);
	~MyQueue();
	void ClearQueue();
	bool QueueEmpty() const;
	bool QueueFull() const;
	int QueueLength() const;
	bool EnQueue(int element);
	bool DeQueue(int &element);
	void QueueTraverse();
private:
	int *m_pQqueue;
	int m_iQueueLen;
	int m_iQueueCapacity;
	int m_iHead;
	int m_iTail;

};

#endif 

//MyQueue.cpp文件
#include "myqueue.h"
#include <iostream>
using namespace std;


MyQueue::MyQueue(int queueCapacity)
{
	m_iQueueCapacity = queueCapacity;
	ClearQueue();
	m_pQqueue = new int[m_iQueueCapacity];

}
MyQueue::~MyQueue()
{
	delete[]m_pQqueue;
}
void MyQueue::ClearQueue()
{
	m_iHead = 0;
	m_iTail = 0;
	m_iQueueLen = 0;
}
bool MyQueue::QueueEmpty() const
{
	if (m_iQueueLen == 0)
	{
		return true;
	}
	else
		return false;
}
bool MyQueue::