What are the operations of a priority queue in C++?

What are the main operations of a priority queue in C++?

In C++, a priority queue typically supports operations like insert, remove, and peek. Would you like details on each?

Yes, please explain the insert operation.

The insert operation adds an element to the priority queue while maintaining the order based on priority. It usually has a time complexity of O(log n).

What about the remove operation?

The remove operation, often called 'pop', removes the element with the highest priority. This also has a time complexity of O(log n).

Can you give an example of how to implement a priority queue in C++?

Sure! You can use the STL priority_queue class. Here's a simple example: std::priority_queue<int> pq; pq.push(10); pq.push(5); pq.pop(); This will remove the highest priority element.