PRIORITY QUEUE USING AVL TREE [ c++ ]

Implement a PriorityQueue where we will store the underlying data as an AVL Tree. For each of the fundamental operations of a PriorityQueue, explain briefly how you would implement it with an AVL Tree. If something is a standard AVL tree operation, such as a re-balance, you need only refer to it. The operations are:

1. insertion

2. extractMin()

3.min()

4.extractMax()

5.Max()