add comments

If a priority queue is implemented as a binary search three instead of a heap, the member functions defined in PQType would not change, but the private data members defined in PQType would change. The only data member would be a pointer to a TreeNode . Complete the dequeue operation, using this implementation template void PQType