C++ priority_queue 🎯

Welcome to the exciting world of C++ programming! Today, we're going to dive into the priority_queue data structure, a powerful tool to manage data efficiently.

Understanding priority_queue 📝

A priority_queue is a container that follows the Last-In-First-Out (LIFO) principle, but with a twist. Unlike a regular LIFO stack, a priority_queue maintains elements in the order of their priority values. The highest priority element is always at the front of the queue, and the lowest at the back.

Creating a priority_queue 💡

To create a priority_queue, you can use the queue template with the std::greater function object as the second template argument:

cpp

#include <queue>

std::priority_queue<int, std::vector<int>, std::greater<int>> my_priority_queue;

In the above example, my_priority_queue is a priority_queue that stores integers. The std::vector<int> argument is the underlying container for the queue, and std::greater<int> makes the queue maintain elements in descending order.

Adding elements to the priority_queue 💡

To add an element to the priority_queue, you can use the push() function:

cpp

my_priority_queue.push(5);
my_priority_queue.push(3);
my_priority_queue.push(8);
my_priority_queue.push(1);

Now, the my_priority_queue looks like this:

8, 5, 3, 1

Checking the priority_queue 💡

To check the current state of the priority_queue, you can use the top() function, but remember, it doesn't modify the queue:

cpp

std::cout << "Top element: " << my_priority_queue.top() << std::endl; // Output: 8

Removing elements from the priority_queue 💡

To remove an element from the priority_queue, you can use the pop() function:

cpp

my_priority_queue.pop();

After popping the top element, the my_priority_queue looks like this:

5, 3, 1

Quiz 💡

Quick Quiz

Question 1 of 1

Which C++ header should be included to use `priority_queue`?

Customizing the priority_queue 💡

You can also create a custom priority_queue with your own data type. Let's create a Student struct and a priority_queue that stores students according to their grades:

cpp

#include <iostream>
#include <queue>
#include <string>

struct Student {
    std::string name;
    int grade;
};

bool compareStudents(const Student& lhs, const Student& rhs) {
    return lhs.grade > rhs.grade;
}

std::priority_queue<Student, std::vector<Student>, decltype(compareStudents)> student_priority_queue(compareStudents);

Now, you can add students to the priority_queue:

cpp

Student s1 = {"Alice", 90};
Student s2 = {"Bob", 85};
Student s3 = {"Charlie", 95};

student_priority_queue.push(s1);
student_priority_queue.push(s2);
student_priority_queue.push(s3);

The student_priority_queue now looks like this:

{"Charlie", 95}, {"Alice", 90}, {"Bob", 85}

Quiz 💡

Quick Quiz

Question 1 of 1

How does a `priority_queue` store elements internally?

That's it for our exploration of the priority_queue in C++! This powerful data structure can help you write more efficient code and tackle complex real-world problems. Keep practicing, and happy coding! 💪