模板类的构造函数和析构函数声明语法

我试图制作一个实现链表的队列，但遇到编译器错误。错误来自我调用析构函数的行上的重载赋值运算符函数（标有全大写注释）。我有一个预感，这是一个简单的修复，与我的构造函数/析构函数声明的语法有关。

我得到的错误指出以下代码： error C2512: 'Queue<char>::Queue' : no appropriate default constructor available

它没有提到构造函数，但是它所指的那一行是下面我试图调用析构函数的那一行。

在此先感谢您的帮助。

#ifndef QUEUE_H
#define QUEUE_H
#include <iostream>
using namespace std;

template <class Type>
class Queue     // Create a Queue data structure implementing a linked list
{
    private:        // The private members
        struct Cell     // The Cell class will be the blueprints for each link in the list
        {
            Type data;      // The information held by the cell
            Cell* next;     // The link to the next cell
        };

        Cell* first = NULL;
        Cell* last = NULL;


    public:     // The public members
        Queue(Type);
        bool isEmpty();
        void push(Type);
        Type pop();
        Queue<Type>& operator=(Queue<Type>&);
        friend ostream& operator<<(ostream&, const Queue<Type>&);
        ~Queue();
};


template<class Type>
Queue<Type>::Queue(Type inputData)      // Constructor that initializes the queue with a new cell that last and first point to
{
    first = new Cell;

    first->data = inputData;
    first->next = NULL;

    last = first;
}




template<class Type>
Queue<Type>& Queue<Type>::operator=(Queue<Type>& queue)     // Overload "=" so that it performs a deep copy of a Queue object
{
    if (!queue.isEmpty())
    {
        ~Queue();      // HERE IS THE ERROR LINE

        Cell* rhs = queue.first;

        while (rhs != NULL)
        {
            push(rhs->data);
            rhs = rhs->next;
        }
    }

    return *this;
}




template<class Type>
Queue<Type>::~Queue()       // Destructor that deallocates all of the memory used by the queue.
{
    if (!isEmpty())     // We only need to deallocate the queue if it is non-empty
    {
        Cell *link = last;

        while (link != NULL)        // Until we reach the end of the queue, keep deleting each link
        {
            pop();
        }

        first = NULL;
        last = NULL;
    }
    else        // If the queue is already empty, let the user know
    {
        cout << "Cannot call destructor. The list is already empty.\n";
    }
}
#endif