Need help! please fill out!! C++ only

//--------------------------------------------------------------------

//

// Laboratory 11, Programming Exercise 1 PriorityQueue.cpp

//

// ** SOLUTION: Heap implementation of the Priority Queue ADT **

//

//--------------------------------------------------------------------

#ifndef PRIORITYQUEUE_CPP

#define PRIORITYQUEUE_CPP

using namespace std;

#include "PriorityQueue.h"

//--------------------------------------------------------------------

template < typename DataType, typename KeyType, typename Comparator >

PriorityQueue::PriorityQueue(int maxNumber)

// Creates an empty priority queue.

{

}

//--------------------------------------------------------------------

template < typename DataType, typename KeyType, typename Comparator >

void PriorityQueue::enqueue(const DataType &newDataItem)

// Inserts newDataItem into a priority queue.

{

}

//--------------------------------------------------------------------

template < typename DataType, typename KeyType, typename Comparator >

DataType PriorityQueue::dequeue()

// Removes the least recently added (front) data item from a priority

// queue and returns it.

{

}

#endif // #ifndef PRIORITYQUEUE_CPP