linked queue

[beaver55]

Hey everyone I have been stuck at a question I am new to linked queues.I just wanna know how can i write a method to make it empty,copy constructor and a destructor.

class Extended_queue: public Queue {
public:
bool full( ) const;
int size( ) const;
void clear( );
};

This is what I got so far for empty method and destructor

void Queue::empty{
return(rear+1) %maxqueue == front;
}
void Queue::~Queue()//Destructer Function
{
while (Front!=NULL)
{
NODE *Temp=Front;
Front=Front->Next;
delete Temp; 
}
} 

Thanks