A priority queue is implemented as a binary search tree. 1. How would the definition of PQType change? 2. Write the Enqueue operation using this implementation. 3. Write the Dequeue operation using this implementation. 4. Compare the Enqueue and Dequeue operations to those for the heap implementation, in terms of Big-O notation.

Under what conditions would this implementation be better or worse than the heap implementation?