循环队列

这段代码存在内存泄漏，先mark一下！
SeqQueue.h

#ifndef SEQQUEUE_H
#define SEQQUEUE_H

#include<iostream>
#include"Queue.h"
using namespace std;

template<typename T>
class SeqQueue:public Queue<T>{
public:
    SeqQueue(int sz=100);
    ~SeqQueue(){/*delete elements;*/}//这里有点问题
    bool EnQueue(const T &x);
    bool DeQueue(T &x);
    bool getFront(T &x);
    bool IsEmpty()const;
    bool IsFull()const;
    int getSize()const;
    void makeEmpty();
    friend ostream& operator<<(ostream& os,SeqQueue<T>& queue){
        for(int i=queue.front;i!=queue.rear;i=(i+1)%queue.maxSize){
            os << queue.elements[i] << " ";
        }
        os << endl;
        return os;
    }

protected:
    int rear,front;
    T *elements;
    int maxSize;
};

#endif // SEQQUEUE_H

SeqQueue.cpp

#include"SeqQueue.h"
#include<assert.h>

template<typename T>
SeqQueue<T>::SeqQueue(int sz)
{
    front = rear = 0;
    maxSize = sz;
    elements = new T(maxSize);
    assert(NULL!=elements);
}

template<typename T>
bool SeqQueue<T>::EnQueue(const T &x)
{
    if(IsFull()){
        return false;
    }
    elements[rear]=x;
    rear=(rear+1)%maxSize;
    return true;
}

template<typename T>
bool SeqQueue<T>::DeQueue(T &x)
{
    if(IsEmpty()){
        return false;
    }
    x = elements[front];
    front = (front+1)%maxSize;
    return true;
}

template<typename T>
bool SeqQueue<T>::getFront(T &x)
{
    if(IsEmpty()){
        return false;
    }
    x = elements[front];
    return true;
}

template<typename T>
bool SeqQueue<T>::IsEmpty() const
{
    return front==rear?true:false;
}

template<typename T>
bool SeqQueue<T>::IsFull() const
{
    return (rear+1)%maxSize==front?true:false;
}

template<typename T>
int SeqQueue<T>::getSize() const
{
    return (rear-front+maxSize)%maxSize;//循环队列里面最多只能放maxSize-1个元素
}


int main()
{
    SeqQueue<int> queue(20);
    int num=0;
    for(int i=0;i<10;++i){
        num++;
        queue.EnQueue(num);
    }
    for(int i=0;i<5;++i){
        queue.DeQueue(num);
    }
    cout << queue;
}

6 7 8 9 10